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, Ekaterinburg, Russia;Department of Mathematics and Mechanics, Ural State University, Ekaterinburg, Russia;Department of Mathematics and Mechanics, Ural State University, Ekaterinburg, Russia
Venue:
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
Year:
2006

Citing 4
Cited 1

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

Genetic Algorithm for Synchronization

LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications

Quantified Score

Hi-index	0.00

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 Černý's construction.