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. © Springer-Verlag Berlin Heidelberg 2006.
Cite
CITATION STYLE
APA
Ananichev, D. S., Volkov, M. V., & Zaks, Y. I. (2006). Synchronizing automata with a letter of deficiency 2. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4036 LNCS, pp. 433–442). Springer Verlag. https://doi.org/10.1007/11779148_39
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free