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

9783540083429, 9783540373056

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

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 ◽

Cited By ~ 3

Author(s):

Masako Takahashi

Keyword(s):

Binary Trees

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 ◽

Cited By ~ 2

Author(s):

Wilhelm J. Erni

Download Full-text

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 ◽

Cited By ~ 7

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 ◽

Cited By ~ 2

Author(s):

G. Rozenberg ◽

D. Vermeir

Keyword(s):

Finite Index ◽

L Systems

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 ◽

Cited By ~ 1

Author(s):

Joost Engelfriet

Keyword(s):

Lindenmayer Systems

Download Full-text

Complexite des demi — Groupes de matrices

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

10.1007/3-540-08342-1_21 ◽

1977 ◽

pp. 269-281

Author(s):

G. Jacob

Download Full-text

Non-deterministic polynomial optimization problems and their approximation

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

10.1007/3-540-08342-1_29 ◽

1977 ◽

pp. 370-379 ◽

Cited By ~ 7

Author(s):

A. Paz ◽

S. Moran

Keyword(s):

Optimization Problems ◽

Polynomial Optimization ◽

Polynomial Optimization Problems

Download Full-text

On the structure of combinatorial problems and structure preserving reductions

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

10.1007/3-540-08342-1_4 ◽

1977 ◽

pp. 45-60 ◽

Cited By ~ 10

Author(s):

Giorgio Ausiello ◽

Alessandro D'Atri ◽

Marco Protasi

Keyword(s):

Combinatorial Problems ◽

Structure Preserving

Download Full-text

The safety of a coroutine system

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

10.1007/3-540-08342-1_34 ◽

1977 ◽

pp. 440-452 ◽

Cited By ~ 1

Author(s):

Jorma Sajaniemi

Download Full-text

Simple programs and their decision problems

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

10.1007/3-540-08342-1_30 ◽

1977 ◽

pp. 380-390 ◽

Cited By ~ 1

Author(s):

A. Pnueli ◽

G. Slutzki

Keyword(s):

Decision Problems

Download Full-text

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

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Rational relations of binary trees

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

The time and tape complexity of developmental languages

L systems of finite index

Macro grammars, lindenmayer systems and other copying devices

Complexite des demi — Groupes de matrices

Non-deterministic polynomial optimization problems and their approximation

On the structure of combinatorial problems and structure preserving reductions

The safety of a coroutine system

Simple programs and their decision problems

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