CAAP '83 : Trees in algebra and programming : 8th colloquium, L'Aquila, March 9-11, 1983 : 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
159 |
| 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'83, Trees in algebra and programming, 8th colloquium, L'Aquila, March 9-11, 1983, Proceedings, ed. by G. Ausiello and M. Protasi, Berlin, Springer, 1983, 1 vol. (VI-416 p.), Lecture notes in computer science, 3-540-12727-5 • CAAP '83, Texte imprimé, 9783662198179 |
Taula de continguts:
- Generalized heterogeneous algebras and partial interpretations
- Applicative information systems
- Acyclic database schemes (of various degrees): A painless introduction
- Efficient algorithms for finding maximal matching in graphs
- A survey of NLC grammars
- Prefix and perfect languages
- Some equivalence results for free choice nets and simple nets and on the periodicity of live free choice nets
- VLSI mesh of trees for data base processing
- Continuite des transducteurs d'etats finis d'arbres
- Completeness results for a polymorphic type system
- A class of program schemes based on tree rewriting systems
- Complete sets of unifiers and matchers in equational theories
- Digital search trees and the generation of an exponentially distributed variate
- Decidable properties of monadic recursive schemas with a depth parameter
- Nivat-processing systems: Decision problems related to protection and synchronization
- Confluent and coherent equational term rewriting systems application to proofs in abstract data types
- An application of maximum bipartite c-matching to subtree isomorphism'
- Characterizing specification languages which admit initial semantics
- Topological bandwidth
- Probabilistic analysis of graph colouring algorithms
- Some further approximation algorithms for the vertex cover problem
- An application of the theory of graphs and hypergraphs to the decomposition of relational database schemes
- Remarks on the pyramidal structure
- Structured theories in LCF
- Alternating tree automata
- Cofinality in reduction graphs.