CAAP '86 : 11th Colloquium on trees in algebra and programming, Nice, France, March 24-26, 1986 : proceedings
Guardat en:
| Autor corporatiu: | |
|---|---|
| Altres autors: | |
| Format: | Livre numérique |
| Idioma: | Anglais |
| Publicat: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Col·lecció: | Lecture notes in computer science
214 |
| Matèries: | |
| Accés en línia: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Nota: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • CAAP '86, proceedings, 11th Colloquium on trees in algebra and programming, Nice, France, March 24-26, 1986, Berlin, Springer-Verlag, 1986, 1 vol. (VI-306 p.), Lecture notes in computer science, 3-540-16443-X • CAAP'86, Texte imprimé, 9783662184677 |
Taula de continguts:
- 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.