An Efficient Algorithm Finds Noticeable Trends and Examples Concerning the Černy Conjecture
A word w is called synchronizing (recurrent, reset, directed) word of a deterministic finite automaton (DFA) if w sends all states of the automaton on a unique state. Jan Černy had found in 1964 a sequence of n-state complete DFA with shortest synchronizing word of length (n–1)2. He had conjectured that it is an upper bound for the length of the shortest synchronizing word for any n-state complete DFA.
The examples of DFA with shortest synchronizing word of length (n–1)2 are relatively rare. To the Černy sequence were added in all examples of Černy, Piricka and Rosenauerova (1971), of Kari (2001) and of Roman (2004).
By help of a program based on some effective algorithms, a wide class of automata of size less than 11 was checked. The order of the algorithm finding synchronizing word is quadratic for overwhelming majority of known to date automata. Some new examples of n-state DFA with minimal synchronizing word of length (n–1)2 were discovered. The program recognized some remarkable trends concerning the length of the minimal synchronizing word.
KeywordsDeterministic finite automaton synchronizing word algorithm complexity Černy conjecture
Unable to display preview. Download preview PDF.
- 8.Kljachko, A.A., Rystsov, I.K., Spivak, M.A.: An extremely combinatorial problem connected with the bound on the length of a recurrent word in an automata. Kybernetika 2, 16–25 (1987)Google Scholar
- 11.Natarajan, B.K.: An algorithmic approach to the automated design of parts orienters. In: ICALP 1978, pp. 132–142. IEEE, Los Alamitos (1986); LNCS, vol. 62, pp. 345–352. Springer, Heidelberg (1978)Google Scholar
- 13.Rho, J.-K., Somenzi, F., Pixley, C.: Minimum Length Synchronizing Sequences of Finite State Machine. In: Proc. of 30th ACM/IEEE DA Conf., pp. 463–466 (1993)Google Scholar
- 14.Roman, A.: A note on Cerny Conjecture for automata with 3-letter alphabet (submitted)Google Scholar
- 17.Trahtman, A.N.: Verification of algorithms for checking some kinds of testability. In: Spoto, F., Scollo, G., Nijholt, A. (eds.) Algebraic Methods in Language Processing, TWLT 21, pp. 253–263 (2003)Google Scholar
- 18.Trahtman, A.N.: Černy conjecture for DFA accepting star-free languages. In: ICALP, Workshop on synchronizing automata, Turku, Finland (2004)Google Scholar
- 19.Trahtman, A.N.: Some results of implemented algorithms of synchronization. In: 10-th Journees Montoises d’Inform., Theor., LIege, Belgia (2004)Google Scholar