×

Halting space-bounded computations. (English) Zbl 0423.68011


MSC:

68Q05 Models of computation (Turing machines, etc.) (MSC2010)
68Q25 Analysis of algorithms and problem complexity
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Hartmanis, J.; Berman, L., On tape bounds for single letter alphabet language processing, Theoret. Comput. Sci., 3, 213-224 (1977) · Zbl 0351.68014
[2] Hopcroft, J. E.; Ullman, J. D., Some results on tape bounded Turing machines, J. ACM, 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, MA · Zbl 0196.01701
[4] Ibarra, O. H., On two-way multihead automata, J. Comput. System Sci., 7, 28-36 (1973) · Zbl 0256.68028
[5] A.R. Meyer and K. Winklemann, personal communication.; A.R. Meyer and K. Winklemann, personal communication.
[6] Monien, B., Transformational methods and their application to complexity problems, Acta Informat., 6, 95-108 (1976) · Zbl 0329.02015
[7] Monien, B., Corrigendum: Transformational methods and their application to complexity problems, Acta Informat., 8, 383-384 (1977) · Zbl 0365.02026
[8] B. Monien, Hierarchies for unary languages, to appear.; B. Monien, Hierarchies for unary languages, to appear.
[9] Sakoda, W. J.; Sipser, M., Nondeterminism and the size of two-way finite automata, Proc. Tenth Annual ACM Symposium on Theory of Computing (1978) · Zbl 1282.68160
[10] Stearns, R. E.; Hartmanis, J.; Lewis, P. M., Hierarchies of memory limited computations, IEEE Conference Record on Switching Circuit Theory and Logical Design, 179-190 (1965) · 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.