Pages that link to "Item:Q840772"
From MaRDI portal
The following pages link to Synchronizing automata preserving a chain of partial orders (Q840772):
Displayed 24 items.
- The Černý conjecture and 1-contracting automata (Q311503) (← links)
- Ideal regular languages and strongly connected synchronizing automata (Q329728) (← links)
- Primitive digraphs with large exponents and slowly synchronizing automata (Q376118) (← links)
- Complexity of problems concerning reset words for cyclic and Eulerian automata (Q442134) (← links)
- Strongly connected synchronizing automata and the language of minimal reset words (Q1637601) (← links)
- A bound for the length of the shortest reset words for semisimple synchronizing automata via the packing number (Q2011387) (← links)
- Extremal synchronizing circular automata (Q2051843) (← links)
- Sync-maximal permutation groups equal primitive permutation groups (Q2096582) (← links)
- Computational complexity of synchronization under sparse regular constraints (Q2140506) (← links)
- Preimage problems for deterministic finite automata (Q2208257) (← links)
- Complexity of road coloring with prescribed reset words (Q2424693) (← links)
- Slowly synchronizing automata with zero and noncomplete sets (Q2435786) (← links)
- An Extremal Series of Eulerian Synchronizing Automata (Q2817403) (← links)
- LOWER BOUNDS FOR THE LENGTH OF RESET WORDS IN EULERIAN AUTOMATA (Q2841998) (← links)
- Checking Whether an Automaton Is Monotonic Is NP-complete (Q2947429) (← links)
- Representation of (Left) Ideal Regular Languages by Synchronizing Automata (Q3194726) (← links)
- (Q3304155) (← links)
- Complexity of Preimage Problems for Deterministic Finite Automata (Q5005132) (← links)
- Synchronizing series-parallel deterministic finite automata with loops and related problems (Q5021111) (← links)
- A Linear Bound on the k-rendezvous Time for Primitive Sets of NZ Matrices (Q5158650) (← links)
- Complexity of Problems Concerning Reset Words for Cyclic and Eulerian Automata (Q5200068) (← links)
- Complexities of Some Problems Related to Synchronizing, Non-Synchronizing and Monotonic Automata (Q5250279) (← links)
- Semisimple Synchronizing Automata and the Wedderburn-Artin Theory (Q5890812) (← links)
- Completely Reachable Automata: An Interplay Between Automata, Graphs, and Trees (Q6072405) (← links)