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

Last update Tue Feb 14 03:49:52 2012 CET by the DBLP Team —

Data released under the ODC-BY 1.0 license — See also our legal information page