CAAP '83

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

428 Seiten, Taschenbuch

Kurzbeschreibung des Verlags

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.

• Reihe: Lecture Notes in Computer Science
• Themen: Informatik und Informationstechnologie Informatik Theoretische Informatik
• ISBN: 9783540127277
• Sprache: Englisch
• Erscheinungsdatum: 01.10.1983
• Größe: 235 x 155 mm
• Verlag: Springer
• Herausgegeben von: G. Ausiello, M. Protasi