Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID11. CAAP 1986: Nice, France
- Paul Franchi-Zannettacci:
CAAP '86, 11th Colloquium on Trees in Algebra and Programming, Nice, France, March 24-26, 1986, Proceedings. Lecture Notes in Computer Science 214, Springer 1986, ISBN 3-540-16443-X
Language Theory
- Eric G. Wagner:
A Categorical Treatment of Pre- and Post Conditions. 1-5 - Robert Cori, Serge Dulucq:
Colourings of Planar Maps and the Equality of Two Languages. 6-16 - Joffroy Beauquier, Béatrice Bérard:
On the Equivalence of Synchronization Sets. 17-29
Algebraic Theory of Semantics
- Francesco Parisi-Presicce:
Inner and Mutual Compatibility of Basic Operations on Module Specifications. 30-44 - Alex Pelin, Jean H. Gallier:
Exact Computation Sequences. 45-59 - Gheorghe Stefanescu:
An Algebraic Theory of Flowchart Schemes. 60-73
Graphs and Grammars
- Michel Bauderon, Bruno Courcelle:
An Algebraic Formalism for Graphs. 74-84 - Elias Dahlhaus, Manfred K. Warmuth:
Membership for Growing Context Sensitive Grammars is Polynomial. 85-99 - Philippe Devienne, Patrick Lebègue:
Weighted Graphs: A Tool for Logic Programming. 100-111
Program Schemes and Programming
- Gilberto Filé:
Classical and Incremental Evaluators for Attribute Grammars. 112-126 - Alberto Pettorossi
:
Transformation Strategies for Deriving On Line Programs. 127-141 - David de Frutos-Escrig:
Probabilistic Ianov's Schemes. 142-157
Tree-Automata and Transducers
- Kai Salomaa:
Alternating Bottom-Up Tree Recognisers. 158-171 - Rafael Casas, Jean-Marc Steyaert:
Bottom-Up Recursion in Trees. 172-182 - Heiko Vogler:
Basic Tree Transducers. 183-195
Probability on Trees
- Philippe Jacquet, Mireille Régnier:
Trie Partitioning Process: Limiting Distributions. 196-210 - Guy Louchard:
Random Walks, Gaussian Processes, and List Structures. 211-224 - René Schott:
Random Walks on Trees. 225-237
Logic for Computing
- Ran Rinat, Nissim Francez, Orna Grumberg:
Infinite Trees, Markings and Well Foundedness. 238-253 - Elias Dahlhaus, Johann A. Makowsky:
Computable Directory Queries. 254-265 - Andrea Asperti, Giuseppe Longo:
Relating Type-Structures: Partial Variations on a Theme of Friedman and Statman. 266-287 - Grazyna Mirkowska, Andrzej Salwicki:
On Applications of Algorithmic Logic. 288-306
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-04-26 18:40 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
