Synchronizing finite automata with short reset words

Abstract Finding synchronizing sequences for finite automata is a very important problem in many practical applications (part orienters in industry, reset problem in biocomputing theory, network issues, etc.). Problem of finding the shortest synchronizing sequence is NP-hard, so polynomial algorithms probably can work only as heuristic ones. In this paper we propose two versions of polynomial algorithms which work better than well-known Eppstein’s greedy algorithm and it is modification, a cycle algorithm, introduced by Trahtman.

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

[2]  Adam Roman.  Problemy synchronizacji automatów skończonych , 2006 .

[3]  Balas K. Natarajan.  An algorithmic approach to the automated design of parts orienters , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[4]  Ehud Shapiro,et al.  DNA molecule provides a computing machine with both data and fuel , 2003, Proceedings of the National Academy of Sciences of the United States of America.

[5]  Jarkko Kari.  Synchronization and Stability of Finite Automata , 2002, J. Univers. Comput. Sci..

[6]  A. N. Trahtman.  A package TESTAS for checking some kinds of testability , 2002, CIAA'02.

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

[8]  David Eppstein,et al.  Algorithms for media , 2002, Discret. Appl. Math..

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

[10]  A. Roman,et al.  Merging States and Synchronization Problem , 2006 .

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

[12]  Jarkko Kari,et al.  A Counter Example to a Conjecture Concerning Synchronizing Words in Finite Automata , 2001, Bull. EATCS.

[13]  Ján Cerný,et al.  On directable automata , 1971, Kybernetika (Praha).

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

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

[16]  Mikhail V. Volkov,et al.  Synchronizing monotonic automata , 2003, Theor. Comput. Sci..