The following pages link to (Q5486002):
Displayed 6 items.
- Descriptional and computational complexity of finite automata -- a survey (Q553312) (← links)
- The complexity of synchronizing Markov decision processes (Q1740670) (← links)
- A note on emptiness for alternating finite automata with a one-letter alphabet (Q2380016) (← links)
- Descriptional and Computational Complexity of Finite Automata (Q3618565) (← links)
- (Q4558784) (← links)
- On history-deterministic one-counter nets (Q6091193) (← links)