CONS-free programs with tree input

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1443 LNCS, Issue , 1998, Pages 271-282

  Ben Amram, Amir M ^a   Petersen, Holger ^b  

^a ACADEMIC COLLEGE OF TEL AVIV YAFFO   (Israel)

^b UNIVERSITY OF STUTTGART   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; DIGITAL STORAGE;

COMPLEXITY CLASS; INPUT DATAS; POINTER EQUALITIES; RECURSIVE PROGRAMS;

LISP (PROGRAMMING LANGUAGE);

EID: 0002481351     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0055060     Document Type: Conference Paper

References (8)

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.
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.
3. B. Jenner and B. Kirsig. Alternierung und logarithmischer Platz. PhD thesis, Universität Hamburg, 1989.
4. N. D. Jones. Computability and Complexity - From a Programming Perspective. MIT Press, Cambridge, Mass., London, England, 1997.
5. N. D. Jones. LOGSPACE and PTIME characterized by programming languages. 1997. Submitted.
6. I. Niepel. Logarithmisch-platzbeschränkte Komplexitätsklassen- Charakterisierung und offene Fragen. Diplomarbeit, Fachbereich Informatik der Universität Hamburg, 1987.
7. N. Pippenger. Pure versus impure Lisp. ACM Transactions on Programming Languages and Systems, 19:223-238, 1997.
8. A. Szepietowski. Turing Machines with Sublogarithmic Space. Number 843 in Lecture Notes in Computer Science. Springer, Berlin-Heidelberg-New York, 1994.