Pages that link to "Item:Q4341035"
From MaRDI portal
The following pages link to Les automates circulaires biaisés vérifient la conjecture de Černý (Q4341035):
Displaying 3 items.
- Sync-maximal permutation groups equal primitive permutation groups (Q2096582) (← links)
- State complexity of the set of synchronizing words for circular automata and automata over binary alphabets (Q2232292) (← links)
- Binary and circular automata having maximal state complexity for the set of synchronizing words (Q6186314) (← links)
