Abstract
We present two infinite series of synchronizing automata with a letter of deficiency 2 whose shortest reset words are longer than those for synchronizing automata obtained by a straightforward modification of Černý’s construction.
Supported by the Russian Foundation for Basic Research, grant 05-01-00540.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Ananichev, D.S., Volkov, M.V.: Synchronizing generalized monotonic automata. Theoret. Comput. Sci. 330, 3–13 (2005)
Černý, J.: Poznámka k homogénnym eksperimentom s konecnými automatami (in Slovak). Mat.-Fyz. Cas. Slovensk. Akad. Vied. 14, 208–216 (1964)
Dubuc, L.: Sur le automates circulaires et la conjecture de Černý (in French). RAIRO Inform. Theor. Appl. 32, 21–34 (1998)
Eppstein, D.: Reset sequences for monotonic automata. SIAM J. Comput. 19, 500–510 (1990)
Frankl, P.: An extremal problem for two families of sets. Eur. J. Comb. 3, 125–127 (1982)
Higgins, P.M.: The range order of a product of i transformations from a finite full transformation semigroup. Semigroup Forum 37, 31–36 (1988)
Kari, J.: Synchronizing finite automata on Eulerian digraphs. Theoret. Comput. Sci. 295, 223–232 (2003)
Mateescu, A., Salomaa, A.: Many-valued truth functions, Černý’s conjecture and road coloring. EATCS Bull. 68, 134–150 (1999)
Pin, J.-E.: Le probléme de la synchronisation et la conjecture de Černý (in French). In: De Luca, A. (ed.) Non-commutative Structures in Algebra and Geometric Combinatorics, CNR, Roma. Quaderni de la Ricerca Scientifica, vol. 109, pp. 37–48 (1981)
Pin, J.-E.: On two combinatorial problems arising from automata theory. Ann. Discrete Math. 17, 535–548 (1983)
Salomaa, A.: Composition sequences for functions over a finite domain. Theoret. Comput. Sci. 292, 263–281 (2003)
Trahtman, A.N.: The Černý conjecture for aperiodic automata. J. Automata, Languages and Combinatorics (accepted)
Trahtman, A.N.: Noticeable trends and some examples concerning the Černý conjecture (unpublished manuscript)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ananichev, D.S., Volkov, M.V., Zaks, Y.I. (2006). Synchronizing Automata with a Letter of Deficiency 2. In: Ibarra, O.H., Dang, Z. (eds) Developments in Language Theory. DLT 2006. Lecture Notes in Computer Science, vol 4036. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11779148_39
Download citation
DOI: https://doi.org/10.1007/11779148_39
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-35428-4
Online ISBN: 978-3-540-35430-7
eBook Packages: Computer ScienceComputer Science (R0)