9. CAAP 1984

Bruno Courcelle (Ed.): Proc. 9th Int. Colloquium Trees in Algebra and Programming (CAAP'84). Cambridge University Press, Cambridge, 1984, ISBN 0-521-26750-1

Giuseppe Longo: Continuous Structures and Analytic Methods in Computer Science. 1-22 BibTeX
Kurt Mehlhorn: On Optimal VLSI-Circuits for the Basic Arithmetic Functions. 23-30 BibTeX
Wolfgang Thomas: Logical Aspects in the Study of Tree Languages. 31-50 BibTeX
Didier Arquès, Jean Françon: Arbres Bien Etiquetes et Fractions Multicontinues. 51-62 BibTeX
Ronald I. Becker, Stephen R. Schach: A Bottom-Up Algorithm for Weight- and Height-Bounded Minimal Partitions of Trees. 63-72 BibTeX
Jean-Pierre Braquelaire: Graphs and Rational Expressions Denoting Regular Trees. 73-92 BibTeX
Nachum Dershowitz, Shmuel Zaks: Patterns in Trees. 93-102 BibTeX
Joost Engelfriet, Heiko Vogler: Regular Characterizations of Macro Tree Transducers. 103-118 BibTeX
Jean Françon, Claude Puech: Histoires de Files de Priorite avec Fusions. 119-138 BibTeX
Martin Gogolla: Partially Ordered Sorts in Algebraic Specifications. 139-154 BibTeX
A. Kanda: Numeration Models of Lambda-Calculus. 155-168 BibTeX
M. Kaufmann: Nearly Tight Bounds for the Longest Edge in an Tree in a VLSI Lay Out. 169-180 BibTeX
Pierre Lescanne: Uniform Termination of Term Rewriting Systems: Recursive Decomposition Ordering with Status. 181-194 BibTeX
Satoru Miyano, Takeshi Hayashi: Alternating Finite Automata on omega-Words. 195-210 BibTeX
E. Paul: Proofs by Inducting in Equational Theories with Relations Between Constructors. 211-226 BibTeX
Laurence Puel: Proofs in the Final Algebra. 227-242 BibTeX
Jean-Claude Raoult: On Graph Rewritings. 243-256 BibTeX
Grzegorz Rozenberg, Emo Welzl: Boundary NLC Grammars. 257-270 BibTeX
M. Soria, Jean-Marc Steyaert: Average Efficiency of Pattern Matching on LISP Expressions. 271-282 BibTeX
K. Theobald: A Theory of Representable Cpo's. 283-298 BibTeX
E. Timmermann: Yields of Infinite Trees. 299-312 BibTeX
Ingo Wegener: Optimal Decisions Trees and One-Time-Only Branching Programs for Symmetric Boolean Functions. 313-325 BibTeX