LOWER BOUNDS FOR THE LENGTH OF RESET WORDS IN EULERIAN AUTOMATA

DOI10.1142/S0129054113400108zbMath1295.68144MaRDI QIDQ2841998

Vladimir V. Gusev

Publication date: 30 July 2013

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

zbMATH Keywords

digraphsreset wordssynchronizing automatonČerny conjectureexponent of a digraph

Mathematics Subject Classification ID

Combinatorics on words (68R15) Formal languages and automata (68Q45)

Related Items (3)

Primitivity and Hurwitz Primitivity of Nonnegative Matrix Tuples: A Unified Approach ⋮ Analytic methods for reachability problems ⋮ An Extremal Series of Eulerian Synchronizing Automata

Cites Work

• Synchronizing automata preserving a chain of partial orders
• Synchronizing finite automata on Eulerian digraphs.
• Exponents of tuples of nonnegative matrices
• Exponents of nonnegative matrix pairs
• Exponents of 2-regular digraphs
• Unzerlegbare, nicht negative Matrizen
• Reset Sequences for Monotonic Automata

This page was built for publication: LOWER BOUNDS FOR THE LENGTH OF RESET WORDS IN EULERIAN AUTOMATA