Automata, Languages and Programming - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

43

(FIVE YEARS 0)

H-INDEX

8

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540083429, 9783540373056

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

The time and tape complexity of developmental languages

Automata, Languages and Programming - Lecture Notes in Computer Science ◽

10.1007/3-540-08342-1_40 ◽

1977 ◽

pp. 509-523 ◽

Author(s):

I. H. Sudborough

Download Full-text

L systems of finite index

Automata, Languages and Programming - Lecture Notes in Computer Science ◽

10.1007/3-540-08342-1_33 ◽

1977 ◽

pp. 430-439 ◽

Author(s):

G. Rozenberg ◽

D. Vermeir

Keyword(s):

Finite Index ◽

Download Full-text

Macro grammars, lindenmayer systems and other copying devices

Automata, Languages and Programming - Lecture Notes in Computer Science ◽

10.1007/3-540-08342-1_17 ◽

1977 ◽

pp. 221-229 ◽

Author(s):

Joost Engelfriet

Keyword(s):

Lindenmayer Systems

Download Full-text

On the time and tape complexity of hyper(1)-AFL's

Automata, Languages and Programming - Lecture Notes in Computer Science ◽

10.1007/3-540-08342-1_18 ◽

1977 ◽

pp. 230-243 ◽

Author(s):

Wilhelm J. Erni

Download Full-text

Rational relations of binary trees

Automata, Languages and Programming - Lecture Notes in Computer Science ◽

10.1007/3-540-08342-1_41 ◽

1977 ◽

pp. 524-538 ◽

Author(s):

Masako Takahashi

Keyword(s):

Download Full-text

On the computational power of reversal-bounded machines

Automata, Languages and Programming - Lecture Notes in Computer Science ◽

10.1007/3-540-08342-1_9 ◽

1977 ◽

pp. 111-119 ◽

Author(s):

Ronald V. Book ◽

Chee K. Yap

Keyword(s):

Computational Power

Download Full-text

On backtracking and greatest fixpoints

Automata, Languages and Programming - Lecture Notes in Computer Science ◽

10.1007/3-540-08342-1_32 ◽

1977 ◽

pp. 412-429 ◽

Author(s):

Willem P. de Roever

Download Full-text

Renaming and erasing in szilard languages

Automata, Languages and Programming - Lecture Notes in Computer Science ◽

10.1007/3-540-08342-1_19 ◽

1977 ◽

pp. 244-257 ◽

Author(s):

Matthias Höpner ◽

Manfred Opp

Download Full-text

Termination tests inside λ-calculus

Automata, Languages and Programming - Lecture Notes in Computer Science ◽

10.1007/3-540-08342-1_8 ◽

1977 ◽

pp. 95-110 ◽

Author(s):

C. Böhm ◽

M. Coppo ◽

M. Dezani-Ciancaglini

Download Full-text

Parallel decomposition of LR(k) parsers

Automata, Languages and Programming - Lecture Notes in Computer Science ◽

10.1007/3-540-08342-1_6 ◽

1977 ◽

pp. 76-86

Author(s):

David B. Benson ◽

Ralph D. Jeffords

Keyword(s):

Parallel Decomposition

Download Full-text