Reset Thresholds of Automata with Two Cycle Lengths

DOI10.1007/978-3-319-08846-4_15zbMath1302.68163arXiv1403.3992OpenAlexW1530466330MaRDI QIDQ3192265

Elena V. Pribavkina, Vladimir V. Gusev

Publication date: 26 September 2014

Published in: International Journal of Foundations of Computer Science, Implementation and Application of Automata (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1403.3992

zbMATH Keywords

synchronizing automataČerný conjectureprimitive digraphsDulmage-Mendelsohn-type digraphsWielandt-type digraphs

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (5)

Synchronizing Automata with Extremal Properties ⋮ On the Number of Synchronizing Colorings of Digraphs ⋮ Unnamed Item ⋮ An Extremal Series of Eulerian Synchronizing Automata ⋮ Attainable Values of Reset Thresholds

Cites Work

• The road coloring problem
• Synchronizing automata with a letter of deficiency 2
• Notable trends concerning the synchronization of graphs and automata
• Synchronizing Automata and the Černý Conjecture
• Generating Small Automata and the Černý Conjecture

This page was built for publication: Reset Thresholds of Automata with Two Cycle Lengths