Pages that link to "Item:Q5208375"
From MaRDI portal
The following pages link to Hardly reachable subsets and completely reachable automata with 1-deficient words (Q5208375):
Displaying 7 items.
- A characterization of completely reachable automata (Q1622956) (← links)
- On completely reachable automata and subset reachability (Q1622980) (← links)
- Reset complexity and completely reachable automata with simple idempotents (Q2112183) (← links)
- Some results concerning careful synchronization of partial automata and subset synchronization of DFA's (Q2164741) (← links)
- Completely reachable automata, primitive groups and the state complexity of the set of synchronizing words (Q2232291) (← links)
- State complexity of the set of synchronizing words for circular automata and automata over binary alphabets (Q2232292) (← links)
- Completely Reachable Automata: An Interplay Between Automata, Graphs, and Trees (Q6072405) (← links)