Pages that link to "Item:Q5534218"
From MaRDI portal
The following pages link to Some Bounds on the Storage Requirements of Sequential Machines and Turing Machines (Q5534218):
Displayed 8 items.
- Theory of one-tape linear-time Turing machines (Q1041220) (← links)
- Complexity of algorithms and computations (Q1153141) (← links)
- Finite approximate approach to the study of the complexity of recursive predicates (Q1255316) (← links)
- Automaticity. II: Descriptional complexity in the unary case (Q1390867) (← links)
- Regular languages accepted by quantum automata (Q1854417) (← links)
- Unary context-free grammars and pushdown automata, descriptional complexity and auxiliary space lower bounds. (Q1872711) (← links)
- Regular approximations of recursive predicates (Q2557691) (← links)
- A note on one-way and two-way automata (Q5582343) (← links)