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

9783540095101, 9783540351689

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Languages of nilpotent and solvable groups (extended abstract)

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

10.1007/3-540-09510-1_49 ◽

1979 ◽

pp. 616-632 ◽

Cited By ~ 4

Author(s):

Denis Thérien

Keyword(s):

Solvable Groups

Download Full-text

Functional characterization of some semantic equalities inside λ-calculus

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

10.1007/3-540-09510-1_11 ◽

1979 ◽

pp. 133-146 ◽

Cited By ~ 7

Author(s):

M. Coppo ◽

M. Dezani-Ciancaglini ◽

P. Salle'

Keyword(s):

Functional Characterization

Download Full-text

Existential quantifiers in abstract data types

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

10.1007/3-540-09510-1_7 ◽

1979 ◽

pp. 73-87 ◽

Cited By ~ 23

Author(s):

M. Broy ◽

W. Dosch ◽

H. Partsch ◽

P. Pepper ◽

M. Wirsing

Keyword(s):

Abstract Data Types ◽

Data Types ◽

Abstract Data

Download Full-text

On constructing LL(k) parsers

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

10.1007/3-540-09510-1_47 ◽

1979 ◽

pp. 585-595 ◽

Cited By ~ 1

Author(s):

Seppo Sippu ◽

Eljas Soisalon-Soininen

Download Full-text

A formal semantics for concurrent systems

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

10.1007/3-540-09510-1_46 ◽

1979 ◽

pp. 571-584 ◽

Cited By ~ 5

Author(s):

M. W. Shields ◽

P. E. Lauer

Keyword(s):

Formal Semantics ◽

Concurrent Systems

Download Full-text

Constructing call-by-value continuation semantics

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

10.1007/3-540-09510-1_45 ◽

1979 ◽

pp. 556-570 ◽

Cited By ~ 1

Author(s):

Ravi Sethi ◽

Adrian Tang

Download Full-text

An axiomatic treatment of ALGOL 68 routines

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

10.1007/3-540-09510-1_43 ◽

1979 ◽

pp. 530-545 ◽

Cited By ~ 9

Author(s):

Richard L. Schwartz

Keyword(s):

Axiomatic Treatment ◽

Algol 68

Download Full-text

Extending the notion of finite index

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

10.1007/3-540-09510-1_38 ◽

1979 ◽

pp. 479-488 ◽

Cited By ~ 4

Author(s):

G. Rozenberg ◽

D. Vermeir

Keyword(s):

Finite Index

Download Full-text

A systematic approach to formal language theory through parallel rewriting

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

10.1007/3-540-09510-1_37 ◽

1979 ◽

pp. 471-478 ◽

Cited By ~ 3

Author(s):

G. Rozenberg

Keyword(s):

Formal Language ◽

Systematic Approach ◽

Formal Language Theory ◽

Language Theory

Download Full-text

A characterization of a dot-depth two analogue of generalized definite languages

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

10.1007/3-540-09510-1_18 ◽

1979 ◽

pp. 230-244 ◽

Cited By ~ 2

Author(s):

Faith E. Fich ◽

J. A. Brzozowski

Download Full-text

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

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Languages of nilpotent and solvable groups (extended abstract)

Functional characterization of some semantic equalities inside λ-calculus

Existential quantifiers in abstract data types

On constructing LL(k) parsers

A formal semantics for concurrent systems

Constructing call-by-value continuation semantics

An axiomatic treatment of ALGOL 68 routines

Extending the notion of finite index

A systematic approach to formal language theory through parallel rewriting

A characterization of a dot-depth two analogue of generalized definite languages

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