A Turing machine space hierarchy

Stanislav Žák

Kybernetika (1979)

  • Volume: 15, Issue: 2, page (100)-121
  • ISSN: 0023-5954

How to cite

top

Žák, Stanislav. "A Turing machine space hierarchy." Kybernetika 15.2 (1979): (100)-121. <http://eudml.org/doc/27632>.

@article{Žák1979,
author = {Žák, Stanislav},
journal = {Kybernetika},
keywords = {diagonalization; hierarchy for space complexity measure; computation on Turing machines; pushdown automata; counter machines; oracle},
language = {eng},
number = {2},
pages = {(100)-121},
publisher = {Institute of Information Theory and Automation AS CR},
title = {A Turing machine space hierarchy},
url = {http://eudml.org/doc/27632},
volume = {15},
year = {1979},
}

TY - JOUR
AU - Žák, Stanislav
TI - A Turing machine space hierarchy
JO - Kybernetika
PY - 1979
PB - Institute of Information Theory and Automation AS CR
VL - 15
IS - 2
SP - (100)
EP - 121
LA - eng
KW - diagonalization; hierarchy for space complexity measure; computation on Turing machines; pushdown automata; counter machines; oracle
UR - http://eudml.org/doc/27632
ER -

References

top
  1. J. H. Hopcroft J. D. Ullman, Formal Languages and their Relation to Automata, Adison-Wesley, Reading, Mass. 1969. (1969) 
  2. H. Rogers, Jr., Theory of Recursive Functions and Effective Computability, McGraw-Hill, New York 1967. (1967) Zbl0183.01401MR0224462
  3. J. I. Seiferas, Nondeterministic time and space complexity classes, Project MAC, TR-137, 1974. (1974) 
  4. J. I. Seiferas, Techniques for separating space complexity classes, JCSS 14 (1977) 1, 73 - 99. (1977) Zbl0352.68062MR0495207
  5. I. H. Sudborough, Separating tape bounded auxiliary pushdown automata classes, Proceedings of the Ninth Annual ACM Symposium on Theory of Computing, Boulder, Colorado, May 2-4, 1977, pp. 208 - 217. (1977) MR0483723
  6. B. A. Trachtenbrot, Optimal computations and the frequency phenomenon of Jablonskij, (In Russian.) Algebra i Logika (Seminar) 4/5 (1965), 79 - 83. (1965) MR0194280
  7. B. A. Trachtenbrot, About normed signaling functions of computations on Turing machines, (In Russian.) Algebra i Logika 5/6 (1966), 61-70. (1966) MR0231671
  8. S. Žák, Functions realizable on Turing machines with bounded memory, (In Czech.) 1975, unpublished, Master thesis, Faculty of Mathematics and Physics, Charles University. (1975) 
  9. S. Žák, A space hierarchy of languages, (In Czech.) 1977, unpublished, RNDr thesis, Faculty of Mathematics and Physics, Charles University. (1977) 

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.