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

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540088608, 9783540358077

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

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 ◽

Cited By ~ 6

Author(s):

Walter J. Savitch

Keyword(s):

Time Complexity ◽

Complexity Classes

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 ◽

Cited By ~ 8

Author(s):

Zvi Galil

Keyword(s):

String Matching ◽

Worst Case ◽

Matching Algorithm ◽

Running Time

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 ◽

Cited By ~ 6

Author(s):

J. M. Boe

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 ◽

Cited By ~ 4

Author(s):

E. Sciore ◽

A. Tang

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 ◽

Cited By ~ 10

Author(s):

Mikko Saarinen

Keyword(s):

Attribute Grammars

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 ◽

Cited By ~ 1

Author(s):

Maurice Mignotte

Keyword(s):

Recursive Sequences

(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 ◽

Cited By ~ 6

Author(s):

M. Coppo ◽

M. Dezani-Ciancaglini ◽

S. Ronchi della Rocca

Keyword(s):

Finite Sets

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 ◽

Cited By ~ 15

Author(s):

Patrick Salle

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 ◽

Cited By ~ 46

Author(s):

Piotr Berman

Ambiguite forte

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

10.1007/3-540-08860-1_5 ◽

1978 ◽

pp. 52-62 ◽

Cited By ~ 2

Author(s):

Joffroy Beauquier

Automata, Languages and Programming - Lecture Notes in Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Parallel and nondeterministic time complexity classes

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

Une famille remarquable de codes indecomposables

Admissible coherent c.p.o.'s

On constructing efficient evaluators for attribute grammars

Some effective results about linear recursive sequences

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

Une extension de la theorie des types en λ-calcul

Relationship between density and deterministic complexity of MP-complete languages

Ambiguite forte

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