Manfred Broy, Martin Wirsing (auth.), Giorgio Ausiello, Marco Protasi (eds.)9783540127277, 3540127275
Table of contents :
Generalized heterogeneous algebras and partial interpretations….Pages 1-34
Applicative information systems….Pages 35-64
Acyclic database schemes (of various degrees): A painless introduction….Pages 65-89
Efficient algorithms for finding maximal matching in graphs….Pages 90-113
A survey of NLC grammars….Pages 114-128
Prefix and perfect languages….Pages 129-140
Some equivalence results for free choice nets and simple nets and on the periodicity of live free choice nets….Pages 141-154
VLSI mesh of trees for data base processing….Pages 155-166
Continuite des transducteurs d’etats finis d’arbres….Pages 167-178
Completeness results for a polymorphic type system….Pages 179-190
A class of program schemes based on tree rewriting systems….Pages 191-204
Complete sets of unifiers and matchers in equational theories….Pages 205-220
Digital search trees and the generation of an exponentially distributed variate….Pages 221-235
Decidable properties of monadic recursive schemas with a depth parameter….Pages 236-254
Nivat-processing systems: Decision problems related to protection and synchronization….Pages 255-268
Confluent and coherent equational term rewriting systems application to proofs in abstract data types….Pages 269-283
An application of maximum bipartite c-matching to subtree isomorphism’….Pages 284-299
Characterizing specification languages which admit initial semantics….Pages 300-316
Topological bandwidth….Pages 317-331
Probabilistic analysis of graph colouring algorithms….Pages 332-340
Some further approximation algorithms for the vertex cover problem….Pages 341-349
An application of the theory of graphs and hypergraphs to the decomposition of relational database schemes….Pages 350-366
Remarks on the pyramidal structure….Pages 367-376
Structured theories in LCF….Pages 377-391
Alternating tree automata….Pages 392-404
Cofinality in reduction graphs….Pages 405-416
Reviews
There are no reviews yet.