![CAAP '86 [electronic resource] : 11th Colloquium on Trees in Algebra and Programming Nice, France, March 24–26, 1986 Proceedings /](/search/themes/bootstrap3/images/libros.png)
CAAP '86 [electronic resource] : 11th Colloquium on Trees in Algebra and Programming Nice, France, March 24–26, 1986 Proceedings /
A categorical treatment of pre- and post- conditions -- Colourings of planar maps and the equality of two languages -- On the equivalence of synchronization sets -- Inner and mutual compatibility of basic operations on module specifications -- Exact computation sequences -- An algebraic theory of flowchart schemes -- An algebraic formalism for graphs -- Membership for growing context sensitive grammars is polynomial -- Weighted graphs : A tool for logic programming -- Classical and incremental evaluators for attribute grammars -- Transformation strategies for deriving on line programs -- Probabilistic Ianov's schemes -- Alternating bottom-up tree recognizers -- Bottom-up recursion in trees -- Basic tree transducers -- Trie partitioning process: Limiting distributions -- Random walks, gaussian processes and list structures -- Random walks on trees -- Infinite trees, markings and well foundedness -- Computable directory queries -- Relating type-structures partial variations on a theme of Friedman and Statman -- On applications of algorithmic logic.
| Main Authors: | , |
|---|---|
| Format: | Texto biblioteca |
| Language: | eng |
| Published: |
Berlin, Heidelberg : Springer Berlin Heidelberg,
1986
|
| Subjects: | Computer science., Computers., Algorithms., Computer logic., Mathematical logic., Algebra., Computer Science., Computation by Abstract Devices., Theory of Computation., Algorithm Analysis and Problem Complexity., Logics and Meanings of Programs., Mathematical Logic and Formal Languages., |
| Online Access: | http://dx.doi.org/10.1007/BFb0022653 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|