CAAP '90 - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

18

(FIVE YEARS 0)

H-INDEX

8

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540525905, 9783540470427

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Petri nets as models of linear logic

CAAP '90 - Lecture Notes in Computer Science ◽

10.1007/3-540-52590-4_46 ◽

1990 ◽

pp. 147-161 ◽

Cited By ~ 16

Author(s):

Uffe Engberg ◽

Glynn Winskel

Keyword(s):

Petri Nets ◽

Linear Logic

Download Full-text

Graph matching in operational semantics and typing

CAAP '90 - Lecture Notes in Computer Science ◽

10.1007/3-540-52590-4_49 ◽

1990 ◽

pp. 191-205 ◽

Cited By ~ 4

Author(s):

Kristoffer Høgsbro Holm

Keyword(s):

Graph Matching ◽

Operational Semantics

Download Full-text

A unified approach for showing language containment and equivalence between various types of ω-automata

CAAP '90 - Lecture Notes in Computer Science ◽

10.1007/3-540-52590-4_43 ◽

1990 ◽

pp. 103-116 ◽

Cited By ~ 8

Author(s):

E. M. Clarke ◽

I. A. Browne ◽

R. P. Kurshan

Keyword(s):

Unified Approach ◽

Language Containment

Download Full-text

ML typability is dexptime-complete

CAAP '90 - Lecture Notes in Computer Science ◽

10.1007/3-540-52590-4_50 ◽

1990 ◽

pp. 206-220 ◽

Cited By ~ 10

Author(s):

A. J. Kfoury ◽

J. Tiuryn ◽

P. Urzyczyn

Download Full-text

Towards the unification of models for concurrency

CAAP '90 - Lecture Notes in Computer Science ◽

10.1007/3-540-52590-4_47 ◽

1990 ◽

pp. 162-176 ◽

Cited By ~ 15

Author(s):

Gian Luigi Ferrari ◽

Ugo Montanari

Download Full-text

Unitary monoid with two generators: An algorithmic point of view

CAAP '90 - Lecture Notes in Computer Science ◽

10.1007/3-540-52590-4_44 ◽

1990 ◽

pp. 117-131 ◽

Cited By ~ 2

Author(s):

M. Crochemore ◽

J. Neraud

Keyword(s):

Point Of View

Download Full-text

On the power of bounded concurrency II: The pushdown automata level

CAAP '90 - Lecture Notes in Computer Science ◽

10.1007/3-540-52590-4_37 ◽

1990 ◽

pp. 1-17 ◽

Cited By ~ 4

Author(s):

Tirza Hirst ◽

David Harel

Keyword(s):

Pushdown Automata

Download Full-text

Trees everywhere

CAAP '90 - Lecture Notes in Computer Science ◽

10.1007/3-540-52590-4_38 ◽

1990 ◽

pp. 18-41 ◽

Cited By ~ 7

Author(s):

Xavier Gérard Viennot

Download Full-text

Equivalence of finite-valued bottom-up finite state tree transducers is decidable

CAAP '90 - Lecture Notes in Computer Science ◽

10.1007/3-540-52590-4_54 ◽

1990 ◽

pp. 269-284 ◽

Cited By ~ 5

Author(s):

Helmut Seidl

Keyword(s):

Bottom Up ◽

Finite State ◽

Tree Transducers ◽

State Tree

Download Full-text

Graphical versus logical specifications

CAAP '90 - Lecture Notes in Computer Science ◽

10.1007/3-540-52590-4_40 ◽

1990 ◽

pp. 57-71 ◽

Cited By ~ 13

Author(s):

Gérard Boudol ◽

Kim G. Larsen

Keyword(s):

Logical Specifications

Download Full-text