论文信息 - Synchronizing automata preserving a chain of partial orders

Synchronizing automata preserving a chain of partial orders

We present a new class of automata which strictly contains the class of aperiodic automata and shares with the latter certain synchronization properties. In particular, every strongly connected automaton in this new class is synchronizing and has a synchronizing word of length @?n(n+1)6@? where n is the number of states of the automaton.

Mikhail V. Volkov

[1] R. McNaughton,et al. Counter-Free Automata , 1971 .

[2] J. Pin. On two Combinatorial Problems Arising from Automata Theory , 1983 .

[3] Mikhail V. Volkov,et al. Synchronizing generalized monotonic automata , 2005, Theor. Comput. Sci..

[4] L. Dubuc,et al. Sur Les Automates Circulaires et la Conjecture de Cerný , 1998, RAIRO Theor. Informatics Appl..

[5] David Eppstein,et al. Reset Sequences for Monotonic Automata , 1990, SIAM J. Comput..

[6] I. K. Rystsov,et al. Reset Words for Commutative and Solvable Automata , 1997, Theor. Comput. Sci..

[7] Arto Salomaa,et al. Composition sequences for functions over a finite domain , 2003, Theor. Comput. Sci..

[8] Sven Sandberg,et al. Homing and Synchronizing Sequences , 2004, Model-Based Testing of Reactive Systems.

[9] Mikhail V. Volkov,et al. Synchronizing Automata and the Cerny Conjecture , 2008, LATA.

[10] A. N. Trahtman. The Černý Conjecture for Aperiodic Automata , 2005 .

[11] P. FRANKL,et al. An Extremal Problem for two Families of Sets , 1982, Eur. J. Comb..

[12] Václav Koubek,et al. Rank Problems for Composite Transformations , 1995, Int. J. Algebra Comput..

[13] Jarkko Kari,et al. Synchronizing Finite Automata on Eulerian Digraphs , 2003, MFCS.

[14] Dmitry S. Ananichev. The Mortality Threshold for Partially Monotonic Automata , 2005, Developments in Language Theory.

[15] Kenneth Y. Goldberg,et al. Orienting polygonal parts without sensors , 1993, Algorithmica.