Lower bounds for the length of reset words in Eulerian automata

Authors:
Vladimir V. Gusev
Affiliations:
Ural Federal University, Ekaterinburg, Russia
Venue:
RP'11 Proceedings of the 5th international conference on Reachability problems
Year:
2011

Citing 6
Cited 1

Reset sequences for monotonic automata

SIAM Journal on Computing
Exponents of 2-regular digraphs

Discrete Mathematics
Synchronizing finite automata on Eulerian digraphs

Theoretical Computer Science - Mathematical foundations of computer science
Synchronizing Automata and the Černý Conjecture

Language and Automata Theory and Applications
Synchronizing automata preserving a chain of partial orders

Theoretical Computer Science
Slowly synchronizing automata and digraphs

MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science

Synchronizing automata of bounded rank

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

Quantified Score

Hi-index	0.00

Visualization

Abstract

For each odd n ≥ 5 we present a synchronizing Eulerian automaton with n states for which the minimum length of reset words is equal to n2-3n+4/2. We also discuss various connections between the reset threshold of a synchronizing automaton and a sequence of reachability properties in its underlying graph.