Some Bounds on the Storage Requirements of Sequential Machines and Turing Machines
From MaRDI portal
Publication:5534218
DOI10.1145/321406.321410zbMath0153.31802OpenAlexW2000920814MaRDI QIDQ5534218
Publication date: 1967
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/321406.321410
Related Items (8)
Unary context-free grammars and pushdown automata, descriptional complexity and auxiliary space lower bounds. ⋮ A note on one-way and two-way automata ⋮ Automaticity. II: Descriptional complexity in the unary case ⋮ Complexity of algorithms and computations ⋮ Finite approximate approach to the study of the complexity of recursive predicates ⋮ Regular approximations of recursive predicates ⋮ Theory of one-tape linear-time Turing machines ⋮ Regular languages accepted by quantum automata
This page was built for publication: Some Bounds on the Storage Requirements of Sequential Machines and Turing Machines
