The LBA-problem and the transformability of the class ɛ2

  • B. Monien
Vorträge In Der Reihenfolge Des Programms
Part of the Lecture Notes in Computer Science book series (LNCS, volume 48)


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Fischer, P.C., Meyer, A.R. and Rosenberg, A.L.: Counter Machines and Counter Languages, Math. Systems Theory 2, 265–283, 1968CrossRefGoogle Scholar
  2. 2.
    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, 1974Google Scholar
  3. 3.
    Grzegorczyk, A.: Some classes of recursive functions, Rozprawy Matematyczne 4, 1–46, 1953Google Scholar
  4. 4.
    Monien, B.: Transformational Methods and their Application to Complexity Problems, Acta Informatica 6, 95–108, 1976CrossRefGoogle Scholar
  5. 5.
    Monien, B.: The LBA-problem and the deterministic tape complexity of two-way one-counter languages over a one-letter alphabet, submitted for publicationGoogle Scholar
  6. 6.
    Ritchie, R.W.: Classes of predictably computable functions, Trans.American Math. Soc. 106, 139–173, 1963Google Scholar
  7. 7.
    Savitch, W.J.: A note on multihead automata and context-sensitive languages, Acta Informatica 2, 249–252, 1973CrossRefGoogle Scholar
  8. 8.
    Sudborough, I.H.: A Note on Tape-Bounded Complexity Classes and Linear Context-Free Languages, J.Ass.Comp.Mach. 22, 499–500, 1975Google Scholar
  9. 9.
    Sudborough, I.H.: On Tape-Bounded Complexity Classes and Multihead Finite Automata, J.Comp. Systems Sciences 10, 62–76, 1975Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1977

Authors and Affiliations

  • B. Monien

There are no affiliations available

Personalised recommendations