Lower bounds for the length of reset words in Eulerian automata

DOI10.1142/S0129054113400108MaRDI QIDQ2841998zbMATHFDO

Authors 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 automatonexponent of a digraphČerny conjecture

Mathematics Subject Classification ID

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

Recommendations

• Lower Bounds for the Length of Reset Words in Eulerian Automata
• An extremal series of Eulerian synchronizing automata
• Synchronizing automata on quasi-Eulerian digraph
• Complexity of problems concerning reset words for cyclic and Eulerian automata
• Synchronizing quasi-Eulerian and quasi-one-cluster automata

Cites work

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

Cited in

(8)

• An extremal series of Eulerian synchronizing automata
• Synchronizing quasi-Eulerian and quasi-one-cluster automata
• Analytic methods for reachability problems
• Primitivity and Hurwitz Primitivity of Nonnegative Matrix Tuples: A Unified Approach
• scientific article; zbMATH DE number 7228447 (Why is no real title available?)
• Lower Bounds for the Length of Reset Words in Eulerian Automata
• Synchronizing automata on quasi-Eulerian digraph
• A bound for the length of the shortest reset words for semisimple synchronizing automata via the packing number

This page was built for publication: Lower bounds for the length of reset words in Eulerian automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2841998)