Pages that link to "Item:Q2282077"
From MaRDI portal
The following pages link to Algebraic synchronization criterion and computing reset words (Q2282077):
Displaying 17 items.
- 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)
- Analytic methods for reachability problems (Q2037188) (← links)
- Černý's conjecture and the road colouring problem (Q2074216) (← links)
- Sync-maximal permutation groups equal primitive permutation groups (Q2096582) (← links)
- Some results concerning careful synchronization of partial automata and subset synchronization of DFA's (Q2164741) (← links)
- Synchronizing sequences for road colored digraphs (Q2197412) (← links)
- Preimage problems for deterministic finite automata (Q2208257) (← links)
- Algebraic synchronization criterion and computing reset words (Q2282077) (← links)
- An Extremal Series of Eulerian Synchronizing Automata (Q2817403) (← links)
- Experiments with Synchronizing Automata (Q2830218) (← links)
- (Q2946328) (redirect page) (← links)
- Synchronizing Automata with Extremal Properties (Q2946348) (← links)
- (Q3304155) (← links)
- (Q5005121) (← links)
- Complexity of Preimage Problems for Deterministic Finite Automata (Q5005132) (← links)
- New characterizations of primitive permutation groups with applications to synchronizing automata (Q6186315) (← links)
