|
" CAAP'83 : "
edited by Giorgio Ausiello, Marco Protasi.
| Document Type
|
:
|
BL
|
| Record Number
|
:
|
745947
|
| Doc. No
|
:
|
b565896
|
| Main Entry
|
:
|
edited by Giorgio Ausiello, Marco Protasi.
|
| Title & Author
|
:
|
CAAP'83 : : Trees in Algebra and Programming 8th Colloquium L'Aquila, March 9–11, 1983 Proceedings\ edited by Giorgio Ausiello, Marco Protasi.
|
| Publication Statement
|
:
|
Berlin, Heidelberg : Springer Berlin Heidelberg, 1983
|
| Series Statement
|
:
|
Lecture notes in computer science, 159.
|
| Page. NO
|
:
|
(X, 418 p. :)
|
| ISBN
|
:
|
3540387145
|
|
|
:
|
: 9783540387145
|
| Contents
|
:
|
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.
|
| Subject
|
:
|
Computer logic.
|
| Subject
|
:
|
Computer science.
|
| Subject
|
:
|
Computer Science.
|
| Added Entry
|
:
|
G Ausiello
|
|
|
:
|
Marco Protasi
|
| |