Around Don's conjecture for binary completely reachable automata

DOI10.1007/978-3-031-66159-4_20MaRDI QIDQ7034825zbMATH OpenFDO

Authors Yinfeng Zhu

Publication date 31 January 2025

Full work available at URL https://doi.org/10.1007/978-3-031-66159-4_20

zbMATH Keywords

complete reachabilitydeterministic finite automatonDon's conjecture

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites work

• Binary completely reachable automata
• Completely reachable automata
• Hardly reachable subsets and completely reachable automata with 1-deficient words
• scientific article; zbMATH DE number 7725599 (Why is no real title available?)
• Synchronization of finite automata
• The Černý conjecture and 1-contracting automata
• Černý's conjecture and the road colouring problem

Cited in

(1)

• Don's conjecture for binary completely reachable automata: an approach and its limitations

This page was built for publication: Around Don's conjecture for binary completely reachable automata

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