Pages that link to "Item:Q1922340"
From MaRDI portal
The following pages link to Almost optimal bound of recurrent word length for regular automata (Q1922340):
Displayed 5 items.
- Strongly transitive automata and the Černý conjecture (Q1038421) (← links)
- Černý's conjecture and the road colouring problem (Q2074216) (← links)
- Cerny's conjecture for automata with simple idempotents (Q2132068) (← links)
- The Synchronization Problem for Locally Strongly Transitive Automata (Q3182926) (← links)
- The Synchronization Problem for Strongly Transitive Automata (Q3533015) (← links)