13. CAAP 1988: Nancy, France

Max Dauchet, Maurice Nivat (Eds.): CAAP '88, 13th Colloquium on Trees in Algebra and Programming, Nancy, France, March 21-24, 1988, Proceedings. Lecture Notes in Computer Science 299 Springer 1988, ISBN 3-540-19021-X

Tree Algorithms

Jochen Burghardt:
A Tree Pattern Matching Algorithm with Reasonable Space Requirements. 1-15
Rolf Klein, Derick Wood:
On the Maximum Path Length of AVL Trees. 16-27
Clemens Lautemann:
Decomposition Trees: Structured Graph Representation and Efficient Algorithms. 28-39

Johannes Köbler, Uwe Schöning, Jacobo Torán:
On Counting and Approximation. 40-51
Helmut Seidl:
Parameter-Reduction of Higher Level Grammars (Extended Abstract). 52-71
Jean Françon, B. Randrianarimanana, René Schott:
Analysis of Dynamic Algorithms in D. E. Knuth's Model. 72-88

Bernhard Möller, Andrzej Tarlecki, Martin Wirsing:
Algebraic Specification with Built-in Domain Constructions. 132-148
Francesco Parisi-Presicce:
Product and Iteration of Module Specifications. 149-164
Isabelle Gnaedig, Claude Kirchner, Hélène Kirchner:
Equational Completion in Order-Sorted Algebras (Extended Abstract). 165-184

E. Pascal Gribomont:
Proving Systolic Arrays. 185-199
Jennifer Widom, Prakash Panagaden:
Expressiveness Bounds for Completness in Trace-Based Network Proof Systems. 200-214
Kim Guldstrand Larsen:
Proof System for Hennessy-Milner Logic with Recursion. 215-230
Z. Habasinski:
Regular Automata and Model Checking. 231-243
Max Michel, Jean-Bernard Stefani:
Interval Logics and Sequential Transducers. 244-257
Roberto Gorrieri, Sergio Marchetti, Ugo Montanari:
A²CCS: A Simple Extension of CCS for Handling Atomic Actions. 258-270
Cornelis Huizing, Rob Gerth, Willem P. de Roever:
Modeling Statecharts Behaviour in a Fully Abstract Way. 271-294

Giorgio Ausiello:
Directed Hypergraphs: Data Structures and Applications. 295-303