UID:
almahu_9948621420202882
Format:
X, 418 p.
,
online resource.
Edition:
1st ed. 1983.
ISBN:
9783540387145
Series Statement:
Lecture Notes in Computer Science, 159
Note:
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.
In:
Springer Nature eBook
Additional Edition:
Printed edition: ISBN 9783662198179
Additional Edition:
Printed edition: ISBN 9783540127277
Language:
English
DOI:
10.1007/3-540-12727-5
URL:
https://doi.org/10.1007/3-540-12727-5
Bookmarklink
