Search from the table of contents of 2.5 million books
Advanced Search (Beta)
Home > Trees in Algebra and Programming - CAAP ' 94: 19th International Colloquium, Edinburgh, U. K. , April 11 - 13, 1994. Proceedings > Graphs and decidable transductions based on edge constraints
Trees in Algebra and Programming - CAAP ' 94: 19th International Colloquium, Edinburgh, U. K. , April 11 - 13, 1994. Proceedings |
Sophie Tison
Springer Berlin Heidelberg
Trees in Algebra and Programming - CAAP ' 94: 19th International Colloquium, Edinburgh, U. K. , April 11 - 13, 1994. Proceedings
Graphs and decidable transductions based on edge constraints
Authors

Nils Klarlund; Michael I. Schwartzbach

ARI Id

1674219705618_2587770

Access

Open/Free Access

Pages

187-201

DOI

10.1007/BFb0017482

Chapter URL

https://rd.springer.com/chapter/10.1007/BFb0017482

Table of Contents of Book
Showing 1 to 20 of 25 entries
Chapters/HeadingsAuthor(s)PagesInfo
Front Matter
Ordering constraints on trees
Hubert Comon; Ralf Treinen
1-14
Graph grammars and tree transducers
Joost Engelfriet
15-36
Type Preorders
Fabio Alessi
37-51
Compilative constructive negation in constraint logic programs
Paola Bruscoli; Francesca Levi; Giorgio Levi; Maria Chiara Meo
52-67
A new linear algorithm for Modular Decomposition
Alain Cournier; Michel Habib
68-84
A CPS-translation of the λμ-calculus
Philippe de Groote
85-99
A lower bound on the growth of functions computed by tree transductions
Frank Drewes
100-114
On the decidability of model checking for several μ-calculi and Petri nets
Javier Esparza
115-129
Generalizations of the periodicity theorem of Fine and Wilf
R. Giancarlo; F. Mignosi
130-141
Probabilistic domains
Reinhold Heckmann
142-156
Some results on top-context-free tree languages
Dieter Hofbauer; Maria Huber; Gregory Kucherov
157-171
On higher order recursive program schemes
Zurab Khasidashvili
172-186
Graphs and decidable transductions based on edge constraints
Nils Klarlund; Michael I. Schwartzbach
187-201
Nondeterministic automata with concurrency relations and domains
Dietrich Kuske
202-217
Algebraic and combinatorial properties of simple, coloured walks
Donatella Merlini; Renzo Sprugnoli; M. Cecilia Verri
218-233
Probabilistic analysis of an election algorithm in a tree
Yves Métivier; Nasser Saheb
234-245
On the first-order equivalence of call-by-name and call-by-value
Thomas Noll
246-260
On the modularity of confluence of constructor-sharing term rewriting systems
Enno Ohlebusch
261-275
Global program analysis in constraint form
Jens Palsberg
276-290
Chapters/HeadingsAuthor(s)PagesInfo
Showing 1 to 20 of 25 entries
Similar Books
Similar Chapters
Similar Thesis

Similar News

Similar Articles
Similar Article Headings