The following pages link to (Q4266486):
Displayed 26 items.
- Synchronizing random automata on a 4-letter alphabet (Q376130) (← links)
- Synchronizing automata with finitely many minimal synchronizing words (Q553327) (← links)
- Synchronizing monotonic automata (Q703567) (← links)
- The road coloring problem (Q731355) (← links)
- Synchronizing automata preserving a chain of partial orders (Q840772) (← links)
- Synchronizing automata with a letter of deficiency 2 (Q880170) (← links)
- Synchronizing finite automata on Eulerian digraphs. (Q1401241) (← links)
- The size of power automata. (Q1401251) (← links)
- Synchronizing generalized monotonic automata (Q1763695) (← links)
- Composition sequences for functions over a finite domain. (Q1853744) (← links)
- An algorithm for road coloring (Q1932365) (← links)
- A multi-parameter analysis of hard problems on deterministic finite automata (Q2256724) (← links)
- Slowly synchronizing automata with zero and noncomplete sets (Q2435786) (← links)
- Composition Sequences and Synchronizing Automata (Q2891329) (← links)
- Recognizing Synchronizing Automata with Finitely Many Minimal Synchronizing Words is PSPACE-Complete (Q3091460) (← links)
- The Synchronization Problem for Locally Strongly Transitive Automata (Q3182926) (← links)
- Synchronizing Automata Preserving a Chain of Partial Orders (Q3503892) (← links)
- The Synchronization Problem for Strongly Transitive Automata (Q3533015) (← links)
- Synchronizing Automata and the Černý Conjecture (Q3540093) (← links)
- 2-Synchronizing Words (Q3540111) (← links)
- Finitely Generated Synchronizing Automata (Q3618621) (← links)
- The Length of Subset Reachability in Nondeterministic Automata (Q4982094) (← links)
- (Q5005150) (← links)
- A Linear Bound on the k-rendezvous Time for Primitive Sets of NZ Matrices (Q5158650) (← links)
- The Synchronizing Probability Function for Primitive Sets of Matrices (Q5859647) (← links)
- Completely Reachable Automata: An Interplay Between Automata, Graphs, and Trees (Q6072405) (← links)