Skip to main content
SpringerLink
Log in
Book cover

International Colloquium on Automata, Languages, and Programming

ICALP 1998: Automata, Languages and Programming pp 271–282Cite as

CONS-free programs with tree input

Extended abstract

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1443))

Abstract

We investigate programs operating on LISP-style input data that may not allocate additional storage. For programs without a test of pointer equality we obtain a strict hierarchy of sets accepted by deterministic, non-deterministic, and recursive programs. We show the classes accepted by programs with the ability to test pointers for equality are closely related to well-known complexity classes where relationships are mostly open.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. G. Buntrock, F. Drewes, C. Lautemann, and T. Mossakowski. Some modifications of auxiliary pushdown automata. Informatique théorique et Applications/Theoretical Informatics and Applications, 25:545–556, 1991.

    MATH  MathSciNet  Google Scholar 

  2. S. A. Cook. Characterizations of pushdown machines in terms of time-bounded computers. Journal of the Association for Computing Machinery, 18:4–18, 1971.

    MATH  MathSciNet  Google Scholar 

  3. B. Jenner and B. Kirsig. Alternierung und logarithmischer Platz. PhD thesis, Universität Hamburg, 1989.

    Google Scholar 

  4. N. D. Jones. Computability and Complexity — From a Programming Perspective. MIT Press, Cambridge, Mass., London, England, 1997.

    Google Scholar 

  5. N. D. Jones. LOGSPACE and PTIME characterized by programming languages. 1997. Submitted.

    Google Scholar 

  6. I. Niepel. Logarithmisch-platzbeschränkte Komplexitätsklassen—Charakterisierung und offene Fragen. Diplomarbeit, Fachbereich Informatik der Universität Hamburg, 1987.

    Google Scholar 

  7. N. Pippenger. Pure versus impure Lisp. A CM Transactions on Programming Languages and Systems, 19:223–238, 1997.

    Article  Google Scholar 

  8. A. Szepietowski. Turing Machines with Sublogarithmic Space. Number 843 in Lecture Notes in Computer Science. Springer, Berlin-Heidelberg-New York, 1994.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. The Academic College of Tel-Aviv, 4 Antokolski Str., 64044, Tel Aviv, Israel

    Amir M. Ben-Amram

  2. Institute of Computer Science, University of Stuttgart, Breitwiesenstr. 20-22, 70565, Stuttgart, Germany

    Holger Petersen

Authors
  1. Amir M. Ben-Amram
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Holger Petersen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Kim G. Larsen Sven Skyum Glynn Winskel

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ben-Amram, A.M., Petersen, H. (1998). CONS-free programs with tree input. In: Larsen, K.G., Skyum, S., Winskel, G. (eds) Automata, Languages and Programming. ICALP 1998. Lecture Notes in Computer Science, vol 1443. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0055060

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64781-2

  • Online ISBN: 978-3-540-68681-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation