Hardly reachable subsets and completely reachable automata with 1-deficient words

DOI10.25596/JALC-2019-321MaRDI QIDQ5208375zbMATH OpenFDO

Authors François Gonze, Raphaël M. Jungers

Publication date 15 January 2020

zbMATH Keywords

synchronizing automata\(\Gamma_1\)-graphreachable automatashort reaching wordsubset reachability

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• On completely reachable automata and subset reachability
• The Černý conjecture and 1-contracting automata
• Synchronizing Automata with Extremal Properties
• Subset synchronization of transitive automata
• Subset synchronization in monotonic automata

Cited in

(9)

• Completely reachable automata
• Completely reachable automata, primitive groups and the state complexity of the set of synchronizing words
• State complexity of the set of synchronizing words for circular automata and automata over binary alphabets
• On completely reachable automata and subset reachability
• Reset complexity and completely reachable automata with simple idempotents
• Completely distinguishable automata and the set of synchronizing words
• Some results concerning careful synchronization of partial automata and subset synchronization of DFA's
• Completely Reachable Automata: An Interplay Between Automata, Graphs, and Trees
• A characterization of completely reachable automata

This page was built for publication: Hardly reachable subsets and completely reachable automata with 1-deficient words

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