Lower Bounds for the Length of Reset Words in Eulerian Automata

DOI10.1007/978-3-642-24288-5_16zbMATH Open1348.68104OpenAlexW2181041555MaRDI QIDQ3172873FDOQ3172873

Vladimir V. Gusev

Publication date: 7 October 2011

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10995/27138

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited In (4)

• Attainable Values of Reset Thresholds
• Synchronizing Automata of Bounded Rank
• Title not available (Why is that?)
• Primitive digraphs with large exponents and slowly synchronizing automata

   Recommendations

• Lower bounds for the length of reset words in Eulerian automata 👍 👎
• Complexity of a Problem Concerning Reset Words for Eulerian Binary Automata 👍 👎
• Complexity of a problem concerning reset words for Eulerian binary automata 👍 👎
• Complexity of problems concerning reset words for cyclic and Eulerian automata 👍 👎
• Complexity of Problems Concerning Reset Words for Cyclic and Eulerian Automata 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• The Complexity of Finding Reset Words in Finite Automata 👍 👎
• Estimation of the length of reset words for automata with simple idempotents 👍 👎
• Complexity of problems concerning reset words for some partial cases of 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 Q3172873)