This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Fischer, P.C., Meyer, A.R. and Rosenberg, A.L.: Counter Machines and Counter Languages, Math. Systems Theory 2, 265–283, 1968
Galil, Z.: Two Way Deterministic Pushdown Automaton Languages and some open problems in the Theory of Computation, 15-th Ann.Symp.Switch.Autom.Theory, 170–177, 1974
Grzegorczyk, A.: Some classes of recursive functions, Rozprawy Matematyczne 4, 1–46, 1953
Monien, B.: Transformational Methods and their Application to Complexity Problems, Acta Informatica 6, 95–108, 1976
Monien, B.: The LBA-problem and the deterministic tape complexity of two-way one-counter languages over a one-letter alphabet, submitted for publication
Ritchie, R.W.: Classes of predictably computable functions, Trans.American Math. Soc. 106, 139–173, 1963
Savitch, W.J.: A note on multihead automata and context-sensitive languages, Acta Informatica 2, 249–252, 1973
Sudborough, I.H.: A Note on Tape-Bounded Complexity Classes and Linear Context-Free Languages, J.Ass.Comp.Mach. 22, 499–500, 1975
Sudborough, I.H.: On Tape-Bounded Complexity Classes and Multihead Finite Automata, J.Comp. Systems Sciences 10, 62–76, 1975
Rights and permissions
Copyright information
© 1977 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Monien, B. (1977). The LBA-problem and the transformability of the class ɛ2 . In: Theoretical Computer Science. Lecture Notes in Computer Science, vol 48. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-08138-0_29
Download citation
DOI: https://doi.org/10.1007/3-540-08138-0_29
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-08138-8
Online ISBN: 978-3-540-37389-6
eBook Packages: Springer Book Archive