Synchronizing Automata Preserving a Chain of Partial Orders

Synchronizing Automata Preserving a Chain of Partial Orders M. V. Volkov

Ural State University, Ekaterinburg, Russia

CIAA 2007, Prague, Finland, 16.07.07 – p.1/25

.

  

  

We consider DFA:




Synchronizing automata

CIAA 2007, Prague, Finland, 16.07.07 – p.2/25

.

   

 

We consider DFA:





Synchronizing automata













The DFA is called synchronizing if there exists a word whose action resets , that is, leaves the automaton in one particular state no matter which state in it started at.

CIAA 2007, Prague, Finland, 16.07.07 – p.2/25

.

   

  

We consider DFA:

  

Synchronizing automata



)

&





(

#

#

!

 &' %



!





"



$













The DFA is called synchronizing if there exists a word whose action resets , that is, leaves the automaton in one particular state no matter which state in it started at. . Here stands for .

CIAA 2007, Prague, Finland, 16.07.07 – p.2/25

.

1 0 / .

. -, 

We consider DFA:

+ * 

Synchronizing automata

*

=

;

3

-

5