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 5 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)
- (Q5005121) (← links)
- Synchronizing series-parallel deterministic finite automata with loops and related problems (Q5021111) (← links)
