The following pages link to (Q4055193):
Displayed 8 items.
- Descriptional and computational complexity of finite automata -- a survey (Q553312) (← links)
- Space bounded computations: Review and new separation results (Q1176238) (← links)
- On the definitions of some complexity classes of real numbers (Q3310597) (← links)
- Some modifications of auxiliary pushdown automata (Q3485868) (← links)
- Descriptional and Computational Complexity of Finite Automata (Q3618565) (← links)
- On the complexity of finite, pushdown, and stack automata (Q4121398) (← links)
- Some open problems in the theory of computation as questions about two-way deterministic pushdown automaton languages (Q4128015) (← links)
- One-Time Nondeterministic Computations (Q5205043) (← links)