CAAP '83 : Trees in algebra and programming, 8th colloquium, L'Aquila, March 9-11, 1983, proceedings
Author(s)
Bibliographic Information
CAAP '83 : Trees in algebra and programming, 8th colloquium, L'Aquila, March 9-11, 1983, proceedings
（Lecture notes in computer science, 159）
Springer-Verlag, 1983
- : gw
- : us
Available at / 58 libraries
-
Library, Research Institute for Mathematical Sciences, Kyoto University数研
L/N||LNCS||1592983596
-
University of Tsukuba Library, Library on Library and Information Science
ger007.08:L-49:159881003740
-
No Libraries matched.
- Remove all filters.
Note
Includes bibliographical references
Description and Table of Contents
Description
With contributions by numerous experts
Table of 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.
by "Nielsen BookData"