Pages that link to "Item:Q311503"
From MaRDI portal
The following pages link to The Černý conjecture and 1-contracting automata (Q311503):
Displaying 22 items.
- The Černý conjecture for one-cluster automata with prime length cycle (Q719288) (← links)
- Strongly transitive automata and the Černý conjecture (Q1038421) (← links)
- Slowly synchronizing automata with fixed alphabet size (Q2042724) (← links)
- Extremal synchronizing circular automata (Q2051843) (← links)
- Sync-maximal permutation groups equal primitive permutation groups (Q2096582) (← links)
- Reset complexity and completely reachable automata with simple idempotents (Q2112183) (← links)
- Cerny's conjecture for automata with simple idempotents (Q2132068) (← 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)
- Černý's conjecture and group representation theory (Q2269531) (← links)
- (Q3304155) (← links)
- (Q3521748) (← links)
- Les automates circulaires biaisés vérifient la conjecture de Černý (Q4341035) (← links)
- (Q5192683) (← links)
- Reset Complexity of Ideal Languages Over a Binary Alphabet (Q5205048) (← links)
- Hardly reachable subsets and completely reachable automata with 1-deficient words (Q5208375) (← links)
- Synchronised automata (Q5365563) (← 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 completely reachable automata (Q6109017) (← links)
- Binary and circular automata having maximal state complexity for the set of synchronizing words (Q6186314) (← links)
