CAAP '83

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

AvG. Ausiello,M. Protasi

Häftad, Engelska, 1983

Del i serien Lecture Notes in Computer Science

572 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.

Beskrivning

With contributions by numerous experts

Produktinformation

Utgivningsdatum:1983-10-01
Mått:155 x 235 x 24 mm
Vikt:645 g
Format:Häftad
Språk:Engelska, Franska
Serie:Lecture Notes in Computer Science
Antal sidor:418
Upplaga:1983
Förlag:Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN:9783540127277

Utforska kategorier

Systemvetenskap och AI inom Data och IT

Innehållsförteckning

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.

Du kanske också är intresserad av

Nyhet

L’amour toujours : Berättelsen om Tidö

Maggie Strömberg, Torbjörn Nilsson

Inbunden, 2026

275 kr

Analysis and Design of Algorithms for Combinatorial Problems

M. Lucertini, G. Ausiello

E-bok

1985

702 kr

Automata, Languages and Programming

G. Ausiello, C. Böhm

Häftad, 1978

556 kr

Signerad!

SIGNERAD - Om julens wälgång

Klara Peters Bastin

Inbunden, 2026

249 kr

Ruth Kvarnström-Jones - SIGNERAD - Systrarna på Sophiahemmet, Inbunden

Signerad!

Del 3

SIGNERAD - Systrarna på Sophiahemmet

Ruth Kvarnström-Jones

Inbunden, 2026

249 kr

Nyhet

Del 11

Medusa

Lars Kepler

Inbunden, 2026

269 kr

-21%

Ha en nice dag

Mikael Yvesand

Inbunden, 2026

189 kr239 kr

-30%

Se dig inte om

Harlan Coben

Pocket, 2026

69 kr99 kr

-19%

Stortaxi

Flora Wiström

Inbunden, 2026

(3)

209 kr259 kr

Nyhet

Svanesång : min syster Diana

Charles Spencer

Inbunden, 2026

269 kr

CAAP '83

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

AvG. Ausiello,M. Protasi

Häftad, Engelska, 1983

Del i serien Lecture Notes in Computer Science

572 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.

Beskrivning

With contributions by numerous experts

Produktinformation

Utgivningsdatum:1983-10-01
Mått:155 x 235 x 24 mm
Vikt:645 g
Format:Häftad
Språk:Engelska, Franska
Serie:Lecture Notes in Computer Science
Antal sidor:418
Upplaga:1983
Förlag:Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN:9783540127277

Utforska kategorier

Systemvetenskap och AI inom Data och IT

Innehållsförteckning

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.