Skip to main content
SpringerLink
Log in

Jede mit Stackautomaten berechenbare Funktion ist elementar

  • 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. A. Grzegorczyk: Some classes of recursive functions; Rozprawy Matematyczne IV, Warszawa (1953).

    Google Scholar 

  2. J. E. Hopcroft, J. D. Ullman: Nonerasing stack automata; Journal of Comp. a. Syst. Sc., Vol. 1 (1967), pp. 166–186.

    Google Scholar 

  3. H. Müller: Über die mit Stackautomaten berechenbaren Funktionen. Archiv f. math. Logik u. Grundl. 13/1–2 (1970).

  4. R. W. Ritchie: Classes of predictably computable functions. Transactions of the Am. Math. Soc., 106 (1963), pp. 139–173.

    Google Scholar 

  5. D. Scott: Some definitorial suggestions for automata theory. Journal of Comp. a. Syst. Sc., Vol 1 (1967), pp. 187–212.

    Google Scholar 

  6. R. E. Stearns, J. Hartmanis, P. M. Lewis II: Hierarchies of memory limited computations; IEEE-Conference Record on Switching Circuit Theory and Logical Design, pp. 179–202. Inst. of Electrical and Electronics Engineers, New York, 1965.

    Google Scholar 

  7. J. D. Ullman: Halting stack automata; Journal of the Ass. for Computing Machinery, Vol. 16, No. 4 (1969), pp. 550–563.

    Google Scholar 

  8. S. Ginsburg, S. A. Greibach, M. A. Harrison: Stack automata and compiling. J. of the Ass. for Comp. Mach. Vol. 14, No. 1 (1967), pp. 172–201.

    Google Scholar 

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. Jede mit Stackautomaten berechenbare Funktion ist elementar. Arch math Logik 15, 19–30 (1972). https://doi.org/10.1007/BF02019772

Download citation

  • Received:

  • Issue Date:

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

Search

Navigation