Pages that link to "Item:Q2096582"
From MaRDI portal
The following pages link to Sync-maximal permutation groups equal primitive permutation groups (Q2096582):
Displaying 4 items.
- Reset complexity and completely reachable automata with simple idempotents (Q2112183) (← links)
- Completely distinguishable automata and the set of synchronizing words (Q6067333) (← 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)