Pages that link to "Item:Q5205048"
From MaRDI portal
The following pages link to Reset Complexity of Ideal Languages Over a Binary Alphabet (Q5205048):
Displaying 7 items.
- 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)
- Completely Reachable Automata: An Interplay Between Automata, Graphs, and Trees (Q6072405) (← links)
- Binary and circular automata having maximal state complexity for the set of synchronizing words (Q6186314) (← links)
- New characterizations of primitive permutation groups with applications to synchronizing automata (Q6186315) (← links)
