Hierarchies of Turing machines with restricted tape alphabet size. (English) Zbl 0307.68037


68Q25 Analysis of algorithms and problem complexity
68Q45 Formal languages and automata
03D10 Turing machines and related notions
Full Text: DOI


[1] Hartmanis, J.; Stearns, R.E., On the computational complexity of algorithms, Trans. amer. math. soc., 117, 285-306, (1965) · Zbl 0131.15404
[2] Hopcroft, J.E.; Ullman, J.D., ()
[3] Ibarra, O.H., A hierarchy theorem for polynomial-space recognition, SIAM J. comput., 3, 184-187, (1974) · Zbl 0294.02013
[4] Seiferas, J.I.; Fischer, M.J.; Meyer, A.R., Refinements of the hierarchies of time and tape complexities, ()
[5] Stearns, R.E.; Hartmanis, J.; Lewis, P.M., Hierarchies of memory limited computations, (), 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. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.