Pages that link to "Item:Q1622956"
From MaRDI portal
The following pages link to A characterization of completely reachable automata (Q1622956):
Displaying 12 items.
- A criterion for the decidability of the \(A\)-completeness problem for definite automata (Q656372) (← links)
- A new technique for reachability of states in concatenation automata (Q777990) (← links)
- On completely reachable automata and subset reachability (Q1622980) (← links)
- Sync-maximal permutation groups equal primitive permutation groups (Q2096582) (← links)
- Reset complexity and completely reachable automata with simple idempotents (Q2112183) (← 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)
- CHARACTERIZATION OF FINITE STATE AUTOMATA—TOPOLOGICAL APPROACH (Q4008487) (← links)
- (Q4782023) (← links)
- (Q5871577) (← links)
- Completely Reachable Automata: An Interplay Between Automata, Graphs, and Trees (Q6072405) (← links)
- Binary completely reachable automata (Q6109017) (← links)