Finite-change automata

  • Burchard von Braunmühl
  • Rutger Verbeek
Vorträge (In Alphabetischer Reihenfolge)
Part of the Lecture Notes in Computer Science book series (LNCS, volume 67)


Turing Machine Neighbour Block Nondeterministic Automaton Main Configuration Work Tape 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. Book, R.V., Greibach, S.A. Quasi-realtime languages, Mathematical Systems Theory 4 (1970), 97–111.CrossRefGoogle Scholar
  2. Hibbard, T.N. A generalization of context-free determinism, Information and Control 11 (1967), 196–238.CrossRefGoogle Scholar
  3. Lewis II, P.M., Stearns, R.E., Hartmanis, J. Memory bounds for the recognition of contextfree and contextsensitive languages, IEEE Conf.Rec. on Switching Circuit Theory and Logical Design (1965), 191–202.Google Scholar
  4. Karp, R.M. Reducibilities among combinatorial problems, in: Miller & Thatcher: Complexity of computer computations, New York 1972, 85–104.Google Scholar
  5. Savitch, W.J. Relationships between nondeterministic and deterministic tape complexities, Journal of Computer and System Sciences 4 (1970), 177–192.Google Scholar
  6. Springsteel, F.N. On the pre-AFL of logn space and related families of languages, Theoretical Computer Science 2 (1976), 295–304.CrossRefGoogle Scholar
  7. Wechsung, G. Komplexitätstheoretische Charakterisierung der kontextfreien und linearen Sprachen, Elektronische Informationsverarbeitung und Kybernetik 12 (1976), 289–300.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1979

Authors and Affiliations

  • Burchard von Braunmühl
  • Rutger Verbeek

There are no affiliations available

Personalised recommendations