Pages that link to "Item:Q442134"
From MaRDI portal
The following pages link to Complexity of problems concerning reset words for cyclic and Eulerian automata (Q442134):
Displaying 10 items.
- Complexity of a problem concerning reset words for Eulerian binary automata (Q515691) (← links)
- The relation between preset distinguishing sequences and synchronizing sequences (Q736851) (← links)
- Approximating the minimum length of synchronizing words is hard (Q1678749) (← links)
- State complexity of the set of synchronizing words for circular automata and automata over binary alphabets (Q2232292) (← links)
- On the height of a finite automaton (Q2574214) (← links)
- Lower bounds for the length of reset words in Eulerian automata (Q2841998) (← links)
- Lower Bounds for the Length of Reset Words in Eulerian Automata (Q3172873) (← links)
- Finding short synchronizing words for prefix codes (Q5005121) (← links)
- Synchronizing series-parallel deterministic finite automata with loops and related problems (Q5021111) (← links)
- (Q5209967) (← links)