Articoli correlati a CAAP '83: Trees in Algebra and Programming. 8th...
CAAP '83: Trees in Algebra and Programming. 8th Colloquium L'Aquila, March 9-11, 1983. Proceedings: 159 - Brossura
Sinossi
With contributions by numerous experts
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
Contenuti
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.
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
Risultati della ricerca per CAAP '83: Trees in Algebra and Programming. 8th...
Immagini fornite dal venditore
CAAP '83
ISBN 10: 3540127275
ISBN 13: 9783540127277
Nuovo
Taschenbuch
Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germania
Valutazione del venditore 5 su 5 stelle
Taschenbuch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -With contributions by numerous experts 428 pp. Englisch. Codice articolo 9783540127277
Compra nuovo
EUR 53,49
Spedizione EUR 23,00
Spedito da Germania a U.S.A.
Spedito da Germania a U.S.A.
Quantità: 2 disponibili
Foto dell'editore
CAAP '83: Trees in Algebra and Programming. 8th Colloquium L'Aquila, March 9-11, 1983. Proceedings (Lecture Notes in Computer Science, 159)
Da: Ria Christie Collections, Uxbridge, Regno Unito
Valutazione del venditore 5 su 5 stelle
Condizione: New. In English. Codice articolo ria9783540127277_new
Compra nuovo
EUR 67,49
Spedizione EUR 13,22
Spedito da Regno Unito a U.S.A.
Spedito da Regno Unito a U.S.A.
Quantità: Più di 20 disponibili
Immagini fornite dal venditore
CAAP '83 : Trees in Algebra and Programming. 8th Colloquium L'Aquila, March 9-11, 1983. Proceedings
Da: AHA-BUCH GmbH, Einbeck, Germania
Valutazione del venditore 5 su 5 stelle
Taschenbuch. Condizione: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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. Codice articolo 9783540127277
Compra nuovo
EUR 61,97
Spedizione EUR 35,00
Spedito da Germania a U.S.A.
Spedito da Germania a U.S.A.
Quantità: 1 disponibili
Immagini fornite dal venditore
CAAP 83
Print on DemandDa: moluna, Greven, Germania
Valutazione del venditore 5 su 5 stelle
Condizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. With contributions by numerous expertsGeneralized heterogeneous algebras and partial interpretations.- Applicative information systems.- Acyclic database schemes (of various degrees): A painless introduction.- Efficient algorithms for finding maximal ma. Codice articolo 4881931
Compra nuovo
EUR 48,37
Spedizione EUR 48,99
Spedito da Germania a U.S.A.
Spedito da Germania a U.S.A.
Quantità: Più di 20 disponibili
Immagini fornite dal venditore
CAAP83. Trees in Algebra and Programming 8th Colloquium LAquila, March 9-11, 1983 Proceeding. (=Lecture Notes in Computer Science; 159).
Da: ralfs-buecherkiste, Herzfelde, MOL, Germania
Valutazione del venditore 5 su 5 stelle
Broschur. Condizione: Gut. 416 S. Computerwissenschaften Mathematik Mathematics Guter Zustand/ Good. Ex-Library. Brownish paper. ha1082113 Sprache: Englisch Gewicht in Gramm: 700. Codice articolo 397772
Compra usato
EUR 7,00
Spedizione EUR 105,00
Spedito da Germania a U.S.A.
Spedito da Germania a U.S.A.
Quantità: 1 disponibili
Immagini fornite dal venditore
CAAP '83
Editore:
Springer, Springer Okt 1983, 1983
ISBN 10: 3540127275
ISBN 13: 9783540127277
Nuovo
Taschenbuch
Da: buchversandmimpf2000, Emtmannsberg, BAYE, Germania
Valutazione del venditore 5 su 5 stelle
Taschenbuch. Condizione: Neu. This item is printed on demand - Print on Demand Titel. Neuware -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.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 428 pp. Englisch. Codice articolo 9783540127277
Compra nuovo
EUR 53,49
Spedizione EUR 60,00
Spedito da Germania a U.S.A.
Spedito da Germania a U.S.A.
Quantità: 1 disponibili
Immagini fornite dal venditore
CAAP '83 | Trees in Algebra and Programming. 8th Colloquium L'Aquila, March 9-11, 1983. Proceedings
Print on DemandDa: preigu, Osnabrück, Germania
Valutazione del venditore 5 su 5 stelle
Taschenbuch. Condizione: Neu. CAAP '83 | Trees in Algebra and Programming. 8th Colloquium L'Aquila, March 9-11, 1983. Proceedings | G. Ausiello (u. a.) | Taschenbuch | x | Englisch | 1983 | Springer | EAN 9783540127277 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu Print on Demand. Codice articolo 102154196
Compra nuovo
EUR 50,25
Spedizione EUR 70,00
Spedito da Germania a U.S.A.
Spedito da Germania a U.S.A.
Quantità: 5 disponibili
Foto dell'editore
CAAP *83: Trees in Algebra and Programming. 8th Colloquium L*Aquila, March 9-11, 1983. Proceedings (Lecture Notes in Computer Science, 159) (English and French Edition)
Da: Mispah books, Redhill, SURRE, Regno Unito
Valutazione del venditore 4 su 5 stelle
Paperback. Condizione: Very Good. Dust Jacket may NOT BE INCLUDED.CDs may be missing. SHIPS FROM MULTIPLE LOCATIONS. book. Codice articolo ERICA79035401272756
Compra usato
EUR 127,85
Spedizione EUR 29,28
Spedito da Regno Unito a U.S.A.
Spedito da Regno Unito a U.S.A.
Quantità: 1 disponibili