The following pages link to The road coloring problem (Q731355):
Displaying 42 items.
- Primitive digraphs with large exponents and slowly synchronizing automata (Q376118) (← links)
- Sets of nonnegative matrices without positive products (Q426069) (← links)
- The generalized road coloring problem and periodic digraphs (Q429736) (← links)
- On incomplete and synchronizing finite sets (Q517035) (← links)
- A note on the rank of semigroups. (Q711607) (← links)
- The Černý conjecture for one-cluster automata with prime length cycle (Q719288) (← links)
- Random walk in a finite directed graph subject to a road coloring (Q742112) (← links)
- A vector space approach to the road coloring problem (Q845078) (← links)
- Approximating the minimum length of synchronizing words is hard (Q1678749) (← links)
- In memoriam: Roy Adler (1931--2016) and the lasting impact of his work (Q1717638) (← links)
- An algorithm for road coloring (Q1932365) (← links)
- The NP-completeness of the road coloring problem (Q1944896) (← links)
- Černý's conjecture and the road colouring problem (Q2074216) (← links)
- Computational complexity of synchronization under sparse regular constraints (Q2140506) (← links)
- Synchronizing sequences for road colored digraphs (Q2197412) (← links)
- A multi-parameter analysis of hard problems on deterministic finite automata (Q2256724) (← links)
- Structure of free semigroupoid algebras (Q2324757) (← links)
- A complete solution to the complexity of synchronizing road coloring for non-binary alphabets (Q2346422) (← links)
- Complexity of road coloring with prescribed reset words (Q2424693) (← links)
- A quadratic algorithm for road coloring (Q2449052) (← links)
- On the Probability of Being Synchronizable (Q2795936) (← links)
- On the Synchronizing Probability Function and the Triple Rendezvous Time for Synchronizing Automata (Q2808158) (← links)
- Completely Reachable Automata (Q2829965) (← links)
- P(l)aying for Synchronization (Q2914704) (← links)
- Groups and semigroups defined by colorings of synchronizing automata (Q2934265) (← links)
- A QUADRATIC UPPER BOUND ON THE SIZE OF A SYNCHRONIZING WORD IN ONE-CLUSTER AUTOMATA (Q3086238) (← links)
- Realization of an Ergodic Markov Chain as a Random Walk Subject to a Synchronizing Road Coloring (Q3094691) (← links)
- The Synchronization Problem for Locally Strongly Transitive Automata (Q3182926) (← links)
- Reset Thresholds of Automata with Two Cycle Lengths (Q3192265) (← links)
- Synchronizing Automata and the Černý Conjecture (Q3540093) (← links)
- A Quadratic Upper Bound on the Size of a Synchronizing Word in One-Cluster Automata (Q3637215) (← links)
- All finite transitive graphs admit a self-adjoint free semigroupoid algebra (Q4965419) (← links)
- Attainable Values of Reset Thresholds (Q5111255) (← links)
- (Q5150411) (← links)
- Synchronizing Almost-Group Automata (Q5859664) (← links)
- Primitivity and Hurwitz Primitivity of Nonnegative Matrix Tuples: A Unified Approach (Q5885810) (← links)
- Resolution of sigma-fields for multiparticle finite-state action evolutions with infinite past (Q6111872) (← links)
- Normalish Amenable Subgroups of the R. Thompson Groups (Q6169901) (← links)
- The road problem and homomorphisms of directed graphs (Q6175007) (← links)
- Binary and circular automata having maximal state complexity for the set of synchronizing words (Q6186314) (← links)
- New characterizations of primitive permutation groups with applications to synchronizing automata (Q6186315) (← links)
- The further chameleon groups of Richard Thompson and Graham Higman: Automorphisms via dynamics for the Higman-Thompson groups~\(G_{n,r}\) (Q6619638) (← links)
