Skip to main content
SpringerLink
Log in

Über die mit Stackautomaten berechenbaren Funktionen

  • Published:
Archiv für mathematische Logik und Grundlagenforschung Aims and scope Submit manuscript

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Literatur

  1. M. Davis: Computability and Unsolvability. McGraw-Hill, New York-Toronto-London (1958).

    Google Scholar 

  2. P. C. Fischer: Turing-Machines with restricted Memory Access. Information and Control9 (1966) pp. 364–379.

    Google Scholar 

  3. S. Ginsburg, S. A. Greibach, M. A. Harrison: Stack Automata and Compiling. JACM, Vol. 14, No. 1 (1967).

  4. A. Grzegorczyk: Some Classes of Recursive Functions. Rozprawy Matematyczne IV, Warszawa (1953).

  5. D. L. Kreider, R. W. Ritchie: A Universal Two-way Automaton. Archiv f. math. Logik u. Grundlagenforschung, 9/3–4 (1966) Seiten 49–58.

    Google Scholar 

  6. R. W. Ritchie: Classes of Predictably Computable Functions. Transact. of the Am. Math. Soc., 106 (1963).

  7. H. Müller: Über die mit Stack-Automaten berechenbaren Funktionen. Dissertation, Techn. Universität Hannover (1968).

Download references

Author information

Authors and Affiliations

  1. Hannover

    Horst Müller

Authors
  1. Horst Müller
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Müller, H. Über die mit Stackautomaten berechenbaren Funktionen. Arch math Logik 13, 60–73 (1970). https://doi.org/10.1007/BF01967652

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01967652

Search

Navigation