Space bounds for processing contentless inputs. (English) Zbl 0307.68036


68Q25 Analysis of algorithms and problem complexity
68Q45 Formal languages and automata
Full Text: DOI


[1] Hardy, G. H.; Wright, E. M., (An Introduction to the Theory of Numbers (1960), Oxford Press) · Zbl 0086.25803
[2] Hopcroft, J. E.; Ullman, J. D., Some results on tape-bounded Turing machines, J. Assoc. Comput. Mach., 16, 168-177 (1967) · Zbl 0188.33501
[3] Hopcroft, J. E.; Ullman, J. D., Formal Languages and Their Relation to Automata, ((1969), Addison-Wesley: Addison-Wesley Reading, Mass.) · Zbl 0196.01701
[4] Lewis, P. M.; Strarns, R. E.; Hartmanis, J., Memory bounds for recognition of context free and context sensitive languages, (IEEE Conf. Record on Switching Circuit Theory and Logical Design (1965)), 191-202 · Zbl 0272.68054
[5] Stearns, R. E.; Hartmanis, J.; Lewis, P. M., Hierarchies of memory limited computations, (IEEE Conf. Record on Switching Circuit Theory and Logical Design (1965)), 179-190 · Zbl 0229.02033
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.