Lower bounds for the length of reset words in Eulerian automata

DOI10.1142/S0129054113400108zbMATH Open1295.68144MaRDI QIDQ2841998FDOQ2841998

Authors: Vladimir V. Gusev 

Publication date: 30 July 2013

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

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

zbMATH Keywords

digraphsreset wordssynchronizing automatonexponent of a digraphČerny conjecture

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (6)

• Primitivity and Hurwitz Primitivity of Nonnegative Matrix Tuples: A Unified Approach
• Analytic methods for reachability problems
• Lower Bounds for the Length of Reset Words in Eulerian Automata
• Title not available (Why is that?)
• Synchronizing automata on quasi-Eulerian digraph
• An Extremal Series of Eulerian Synchronizing Automata

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)