+612 9045 4394
 
CHECKOUT
Caap '83 : Trees in Algebra and Programming. 8th Colloquium l'Aquila, March 9-11, 1983. Proceedings - G. Ausiello

Caap '83

Trees in Algebra and Programming. 8th Colloquium l'Aquila, March 9-11, 1983. Proceedings

By: G. Ausiello (Editor), M. Protasi (Editor)

Paperback Published: 1st October 1983
ISBN: 9783540127277
Number Of Pages: 418

Share This Book:

Paperback

$147.02
or 4 easy payments of $36.76 with Learn more
Ships in 5 to 9 business days

With contributions by numerous experts

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.

ISBN: 9783540127277
ISBN-10: 3540127275
Series: Lecture Notes in Computer Science
Audience: General
Format: Paperback
Language: English , French
Number Of Pages: 418
Published: 1st October 1983
Publisher: SPRINGER VERLAG GMBH
Country of Publication: DE
Dimensions (cm): 23.39 x 15.6  x 2.21
Weight (kg): 0.59