Synchronizing automata on quasi-eulerian digraph

Authors:
Mikhail V. Berlinkov
Affiliations:
Institute of Mathematics and Computer Science, Ural Federal University, Ekaterinburg, Russia
Venue:
CIAA'12 Proceedings of the 17th international conference on Implementation and Application of Automata
Year:
2012

Citing 6
Cited 0

Matrix analysis and applied linear algebra

Matrix analysis and applied linear algebra
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
Slowly synchronizing automata and digraphs

MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Modifying the upper bound on the length of minimal synchronizing word

FCT'11 Proceedings of the 18th international conference on Fundamentals of computation theory
The Synchronizing Probability Function of an Automaton

SIAM Journal on Discrete Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

We describe a new version of the so-called extension method that was used to prove quadratic upper bounds on the minimum length of reset words for various important classes of synchronizing automata. Our approach is formulated in terms of Markov chains; it is in a sense dual to the usual extension method and improves on a recent result by Jungers. As an application, we obtain a quadratic upper bound on the minimum length of reset words for a generalization of Eulerian automata.