Synchronizing automata with a letter of deficiency 2

Authors:
D. S. Ananichev;M. V. Volkov;Yu. I. Zaks
Affiliations:
Department of Mathematics and Mechanics, Ural State University, 620083 Ekaterinburg, Russia;Department of Mathematics and Mechanics, Ural State University, 620083 Ekaterinburg, Russia;Department of Mathematics and Mechanics, Ural State University, 620083 Ekaterinburg, Russia
Venue:
Theoretical Computer Science
Year:
2007

Citing 5
Cited 10

Reset sequences for monotonic automata

SIAM Journal on Computing
Composition sequences for functions over a finite domain

Theoretical Computer Science
Synchronizing finite automata on Eulerian digraphs

Theoretical Computer Science - Mathematical foundations of computer science
Synchronizing generalized monotonic automata

Theoretical Computer Science - Insightful theory
An efficient algorithm finds noticeable trends and examples concerning the Černy conjecture

MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science

Shortest Synchronizing Strings for Huffman Codes

MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
Synchronizing Automata and the Černý Conjecture

Language and Automata Theory and Applications
Shortest synchronizing strings for Huffman codes

Theoretical Computer Science
Černý's conjecture and group representation theory

Journal of Algebraic Combinatorics: An International Journal
The averaging trick and the Černý conjecture

DLT'10 Proceedings of the 14th international conference on Developments in language theory
Slowly synchronizing automata and digraphs

MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
COMPAS: a computing package for synchronization

CIAA'10 Proceedings of the 15th international conference on Implementation and application of automata
Experimental study of the shortest reset word of random automat

CIAA'11 Proceedings of the 16th international conference on Implementation and application of automata
P(l)aying for synchronization

CIAA'12 Proceedings of the 17th international conference on Implementation and Application of Automata
Synchronizing automata of bounded rank

CIAA'12 Proceedings of the 17th international conference on Implementation and Application of Automata

Quantified Score

Hi-index	5.23

Visualization

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 Cerny's construction.