---

＜電子ブック＞
CAAP '83 : Trees in Algebra and Programming. 8th Colloquium L'Aquila, March 9-11, 1983. Proceedings / edited by G. Ausiello, M. Protasi
(Lecture Notes in Computer Science. ISSN:16113349 ; 159)

版	1st ed. 1983.
出版者	(Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer)
出版年	1983
本文言語	英語
大きさ	X, 418 p : online resource
著者標目	Ausiello, G editor Protasi, M editor SpringerLink (Online service)
件　名	LCSH:Computer science FREE:Computer Science Logic and Foundations of Programming
一般注記	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 HTTP:URL=https://doi.org/10.1007/3-540-12727-5

 類似資料