The following pages link to Completely Reachable Automata (Q2829965):
Displaying 11 items.
- Sync-maximal permutation groups equal primitive permutation groups (Q2096582) (← links)
- Reset complexity and completely reachable automata with simple idempotents (Q2112183) (← links)
- Preimage problems for deterministic finite automata (Q2208257) (← 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)
- Complexity of Preimage Problems for Deterministic Finite Automata (Q5005132) (← links)
- Reset Complexity of Ideal Languages Over a Binary Alphabet (Q5205048) (← links)
- On the Interplay Between Černý and Babai’s Conjectures (Q5384433) (← links)
- (Q5871577) (← links)
- Synchronization problems in automata without non-trivial cycles (Q5919579) (← links)
- Completely Reachable Automata: An Interplay Between Automata, Graphs, and Trees (Q6072405) (← links)
