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

TOTAL DOCUMENTS

37

(FIVE YEARS 0)

H-INDEX

10

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540088608, 9783540358077

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Une famille remarquable de codes indecomposables

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

10.1007/3-540-08860-1_9 ◽

1978 ◽

pp. 105-112 ◽

Author(s):

J. M. Boe

Download Full-text

Admissible coherent c.p.o.'s

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

10.1007/3-540-08860-1_33 ◽

1978 ◽

pp. 440-456 ◽

Author(s):

E. Sciore ◽

A. Tang

Download Full-text

On constructing efficient evaluators for attribute grammars

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

10.1007/3-540-08860-1_29 ◽

1978 ◽

pp. 382-397 ◽

Author(s):

Mikko Saarinen

Keyword(s):

Attribute Grammars

Download Full-text

Some effective results about linear recursive sequences

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

10.1007/3-540-08860-1_23 ◽

1978 ◽

pp. 322-329 ◽

Author(s):

Maurice Mignotte

Keyword(s):

Recursive Sequences

Download Full-text

(Semi)-separability of finite sets of terms in Scott's D∞-models of the λ-calculus

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

10.1007/3-540-08860-1_12 ◽

1978 ◽

pp. 142-164 ◽

Author(s):

M. Coppo ◽

M. Dezani-Ciancaglini ◽

S. Ronchi della Rocca

Keyword(s):

Download Full-text

Une extension de la theorie des types en λ-calcul

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

10.1007/3-540-08860-1_30 ◽

1978 ◽

pp. 398-410 ◽

Author(s):

Patrick Salle

Download Full-text

Relationship between density and deterministic complexity of MP-complete languages

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

10.1007/3-540-08860-1_6 ◽

1978 ◽

pp. 63-71 ◽

Author(s):

Piotr Berman

Download Full-text

Parallel and nondeterministic time complexity classes

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

10.1007/3-540-08860-1_31 ◽

1978 ◽

pp. 411-424 ◽

Author(s):

Walter J. Savitch

Keyword(s):

Time Complexity ◽

Complexity Classes

Download Full-text

On improving the worst case running time of the Boyer-Moore string matching algorithm

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

10.1007/3-540-08860-1_18 ◽

1978 ◽

pp. 241-250 ◽

Author(s):

Zvi Galil

Keyword(s):

String Matching ◽

Matching Algorithm ◽

Download Full-text

Sur l'inversion des morphismes d'arbres

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

10.1007/3-540-08860-1_3 ◽

1978 ◽

pp. 26-35 ◽

Author(s):

A. Arnold ◽

M. Dauchet

Download Full-text