The following pages link to (Q5509690):
Displaying 50 items.
- The Černý conjecture and 1-contracting automata (Q311503) (← links)
- Ideal regular languages and strongly connected synchronizing automata (Q329728) (← links)
- A graph theoretic approach to automata minimality (Q418805) (← links)
- Complexity of problems concerning reset words for cyclic and Eulerian automata (Q442134) (← links)
- Recent results on syntactic groups of prefix codes. (Q444391) (← links)
- Černý conjecture for edge-colored digraphs with few junctions (Q510555) (← links)
- Complexity of a problem concerning reset words for Eulerian binary automata (Q515691) (← links)
- On incomplete and synchronizing finite sets (Q517035) (← links)
- Synchronizing automata with finitely many minimal synchronizing words (Q553327) (← links)
- Synchronizing monotonic automata (Q703567) (← links)
- The Černý conjecture for one-cluster automata with prime length cycle (Q719288) (← links)
- The relation between preset distinguishing sequences and synchronizing sequences (Q736851) (← links)
- Extremal binary PFAs in a Černý family (Q832924) (← links)
- Constrained synchronization and subset synchronization problems for weakly acyclic automata (Q832939) (← links)
- Shortest synchronizing strings for Huffman codes (Q837184) (← links)
- Synchronizing automata preserving a chain of partial orders (Q840772) (← links)
- Synchronizing automata with a letter of deficiency 2 (Q880170) (← links)
- On primitivity of sets of matrices (Q900654) (← links)
- Lifespan in a primitive Boolean linear dynamical system (Q907226) (← links)
- Algorithms for media (Q947070) (← links)
- Synchronization (Q948067) (← links)
- A series of slowly synchronizing automata with a zero state over a small alphabet (Q948092) (← links)
- A finite set of functions with an EXPTIME-complete composition problem (Q955009) (← links)
- Improved upper bounds on synchronizing nondeterministic automata (Q989550) (← links)
- On synchronizing unambiguous automata (Q1116340) (← links)
- Image reducing words and subgroups of free groups. (Q1426037) (← links)
- Experiments with automata when the upper bound of the number of their states is unknown (Q1570268) (← links)
- Strongly connected synchronizing automata and the language of minimal reset words (Q1637601) (← links)
- Problems on finite automata and the exponential time hypothesis (Q1662614) (← links)
- Approximating the minimum length of synchronizing words is hard (Q1678749) (← links)
- Computational complexity of certain problems related to carefully synchronizing words for partial automata and directing words for nondeterministic automata (Q1678755) (← links)
- Some contributions to the theory of transformation monoids (Q1712470) (← links)
- The complexity of synchronizing Markov decision processes (Q1740670) (← links)
- Synchronizing generalized monotonic automata (Q1763695) (← links)
- A bound for the length of the shortest reset words for semisimple synchronizing automata via the packing number (Q2011387) (← links)
- Computational complexity of synchronization under regular commutative constraints (Q2019491) (← links)
- Simplicity of augmentation submodules for transformation monoids (Q2042297) (← links)
- Slowly synchronizing automata with fixed alphabet size (Q2042724) (← links)
- Extremal synchronizing circular automata (Q2051843) (← links)
- Synchronizing words for real-time deterministic pushdown automata (extended abstract) (Q2079977) (← links)
- Sync-maximal permutation groups equal primitive permutation groups (Q2096582) (← links)
- Reset complexity and completely reachable automata with simple idempotents (Q2112183) (← links)
- Distributed graph problems through an automata-theoretic Lens (Q2117706) (← links)
- Cerny's conjecture for automata with simple idempotents (Q2132068) (← links)
- Computational complexity of synchronization under sparse regular constraints (Q2140506) (← links)
- Some results concerning careful synchronization of partial automata and subset synchronization of DFA's (Q2164741) (← links)
- Constrained synchronization for monotonic and solvable automata and automata with simple idempotents (Q2164757) (← links)
- Careful synchronization of partial deterministic finite automata (Q2170286) (← links)
- Synchronizing sequences for road colored digraphs (Q2197412) (← links)
- Preimage problems for deterministic finite automata (Q2208257) (← links)
