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

9783540557197, 9783540472780

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Program composition via unification

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

10.1007/3-540-55719-9_113 ◽

1992 ◽

pp. 672-684 ◽

Cited By ~ 2

Author(s):

Limor Fix ◽

Nissim Francez ◽

Orna Grumberg

Keyword(s):

Program Composition

Download Full-text

Disjunctive systems and L-Domains

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

10.1007/3-540-55719-9_81 ◽

1992 ◽

pp. 284-295 ◽

Cited By ~ 6

Author(s):

Guo-Qiang Zhang

Download Full-text

Adaptive pattern matching

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

10.1007/3-540-55719-9_78 ◽

1992 ◽

pp. 247-260 ◽

Cited By ~ 10

Author(s):

R. C. Sekar ◽

R. Ramesh ◽

I. V. Ramakrishnan

Keyword(s):

Pattern Matching ◽

Adaptive Pattern

Download Full-text

Toward formal development of programs from algebraic specifications: Model-theoretic foundations

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

10.1007/3-540-55719-9_112 ◽

1992 ◽

pp. 656-671 ◽

Cited By ~ 5

Author(s):

Donald Sannella ◽

Andrzej Tarlecki

Keyword(s):

Algebraic Specifications ◽

Formal Development ◽

Theoretic Foundations

Download Full-text

A new metric between polygons, and how to compute it

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

10.1007/3-540-55719-9_92 ◽

1992 ◽

pp. 404-415

Author(s):

Günter Rote

Download Full-text

Approximation algorithms for graph augmentation

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

10.1007/3-540-55719-9_85 ◽

1992 ◽

pp. 330-341 ◽

Cited By ~ 7

Author(s):

Samir Khuller ◽

Ramakrishna Thurimella

Keyword(s):

Approximation Algorithms ◽

Graph Augmentation

Download Full-text

The average CRI-length of a tree collision resolution algorithm in presence of multiplicity-dependent capture effects

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

10.1007/3-540-55719-9_76 ◽

1992 ◽

pp. 223-234 ◽

Cited By ~ 2

Author(s):

Ulrich Schmid

Keyword(s):

Collision Resolution ◽

Resolution Algorithm

Download Full-text

New results concerning synchronized finite automata

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

10.1007/3-540-55719-9_69 ◽

1992 ◽

pp. 126-137

Author(s):

Oscar H. Ibarra ◽

Nicholas Q. Trân

Keyword(s):

Finite Automata

Download Full-text

A parametric approach to localities

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

10.1007/3-540-55719-9_109 ◽

1992 ◽

pp. 617-628 ◽

Cited By ~ 20

Author(s):

Ugo Montanari ◽

Daniel Yankelevich

Keyword(s):

Parametric Approach

Download Full-text

Timing Petri Nets categorically

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

10.1007/3-540-55719-9_105 ◽

1992 ◽

pp. 571-582 ◽

Cited By ~ 7

Author(s):

Carolyn Brown ◽

Doug Gurr

Keyword(s):

Petri Nets

Download Full-text

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

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Program composition via unification

Disjunctive systems and L-Domains

Adaptive pattern matching

Toward formal development of programs from algebraic specifications: Model-theoretic foundations

A new metric between polygons, and how to compute it

Approximation algorithms for graph augmentation

The average CRI-length of a tree collision resolution algorithm in presence of multiplicity-dependent capture effects

New results concerning synchronized finite automata

A parametric approach to localities

Timing Petri Nets categorically

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