Pages that link to "Item:Q311503"
From MaRDI portal
The following pages link to The Černý conjecture and 1-contracting automata (Q311503):
Displaying 11 items.
- Slowly synchronizing automata with fixed alphabet size (Q2042724) (← links)
- Sync-maximal permutation groups equal primitive permutation groups (Q2096582) (← links)
- Reset complexity and completely reachable automata with simple idempotents (Q2112183) (← links)
- Some results concerning careful synchronization of partial automata and subset synchronization of DFA's (Q2164741) (← 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)
- (Q3304155) (← links)
- Reset Complexity of Ideal Languages Over a Binary Alphabet (Q5205048) (← links)
- On the Interplay Between Černý and Babai’s Conjectures (Q5384433) (← 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)
