11. CAAP 1986: Nice, France

@proceedings{DBLP:conf/caap/1986,
  editor    = {Paul Franchi-Zannettacci},
  title     = {CAAP '86, 11th Colloquium on Trees in Algebra and Programming,
               Nice, France, March 24-26, 1986, Proceedings},
  booktitle = {CAAP},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {214},
  year      = {1986},
  isbn      = {3-540-16443-X},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Language Theory

• Eric G. Wagner: A Categorical Treatment of Pre- and Post Conditions. 1-5 BibTeX
• Robert Cori, Serge Dulucq: Colourings of Planar Maps and the Equality of Two Languages. 6-16 BibTeX
• Joffroy Beauquier, Béatrice Bérard: On the Equivalence of Synchronization Sets. 17-29 BibTeX

Algebraic Theory of Semantics

• Francesco Parisi-Presicce: Inner and Mutual Compatibility of Basic Operations on Module Specifications. 30-44 BibTeX
• Alex Pelin, Jean H. Gallier: Exact Computation Sequences. 45-59 BibTeX
• Gheorghe Stefanescu: An Algebraic Theory of Flowchart Schemes. 60-73 BibTeX

Graphs and Grammars

• Michel Bauderon, Bruno Courcelle: An Algebraic Formalism for Graphs. 74-84 BibTeX
• Elias Dahlhaus, Manfred K. Warmuth: Membership for Growing Context Sensitive Grammars is Polynomial. 85-99 BibTeX
• Philippe Devienne, Patrick Lebègue: Weighted Graphs: A Tool for Logic Programming. 100-111 BibTeX

Program Schemes and Programming

• Gilberto Filé: Classical and Incremental Evaluators for Attribute Grammars. 112-126 BibTeX
• Alberto Pettorossi: Transformation Strategies for Deriving On Line Programs. 127-141 BibTeX
• David de Frutos-Escrig: Probabilistic Ianov's Schemes. 142-157 BibTeX

Tree-Automata and Transducers

• Kai Salomaa: Alternating Bottom-Up Tree Recognisers. 158-171 BibTeX
• Rafael Casas, Jean-Marc Steyaert: Bottom-Up Recursion in Trees. 172-182 BibTeX
• Heiko Vogler: Basic Tree Transducers. 183-195 BibTeX

Probability on Trees

• Philippe Jacquet, Mireille Régnier: Trie Partitioning Process: Limiting Distributions. 196-210 BibTeX
• Guy Louchard: Random Walks, Gaussian Processes, and List Structures. 211-224 BibTeX
• René Schott: Random Walks on Trees. 225-237 BibTeX

Logic for Computing

• Ran Rinat, Nissim Francez, Orna Grumberg: Infinite Trees, Markings and Well Foundedness. 238-253 BibTeX
• Elias Dahlhaus, Johann A. Makowsky: Computable Directory Queries. 254-265 BibTeX
• Andrea Asperti, Giuseppe Longo: Relating Type-Structures: Partial Variations on a Theme of Friedman and Statman. 266-287 BibTeX
• Grazyna Mirkowska, Andrzej Salwicki: On Applications of Algorithmic Logic. 288-306 BibTeX