Halting space-bounded computations

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn 1978-October, Issue , 1978, Pages 73-74

  Sipser, Michael ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84855991360     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/sfcs.1978.18     Document Type: Conference Paper

References (7)

1. Hartmanis, J. and L. Berman, (1975), "A Note on Tape Bounds For SLA Language Processing," Sixteenth Annual Symposium on Foundations of Computer Science, 65-70.
2. Hopcroft J.E., and J.O. Ullman, (1969), "Some Results on Tape Bounded Turing Machines," JACM 16, 168-188.
3. Hopcroft, J.E. and J.D. Ullman, (1969), Formal Languages and Their Relation to Automata, Addison-Wesley, Reading, Mass.
4. Ibarra, O.H., (1973), "On Two-Way Multihead Automata," JCSS 7:28-36.
5. Sakoda, W.J. and M. Sipser, (1978), "Non-determinism and the Size of Two-Way Finite Automata," Tenth Annual ACM Symposium an Theory of Computing.
6. Stearns, R.E., Hartmanis, J, and P.M. Lewis II, (1965), "Hierarchies of Memory Limited Computations," IEEE Conference Record on Switching Circuit the.ory and Logical Design, 191-202.
7. Monien, B., (1977), "Hierarchies for Unary Languages," manuscript.