Seller: GreatBookPrices, Columbia, MD, U.S.A.
Condition: New. Seller Inventory # 5908108-n
Seller: BargainBookStores, Grand Rapids, MI, U.S.A.
Paperback or Softback. Condition: New. Caap '81: Trees in Algebra and Programming /6th Colloquium, Genoa, March 5-7, 1981. Proceedings. Book. Seller Inventory # BBS-9783540108283
Seller: Chiron Media, Wallingford, United Kingdom
PF. Condition: New. This item is printed on demand. Brand new book, sourced directly from publisher. Dispatch time is 6-7 days from our warehouse. Book will be sent in robust, secure packaging to ensure it reaches you securely. Seller Inventory # 6666-IUK-9783540108283
Quantity: 20 available
Seller: California Books, Miami, FL, U.S.A.
Condition: New. Seller Inventory # I-9783540108283
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Condition: As New. Unread book in perfect condition. Seller Inventory # 5908108
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Condition: New. Seller Inventory # 5908108-n
Quantity: Over 20 available
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Condition: As New. Unread book in perfect condition. Seller Inventory # 5908108
Quantity: Over 20 available
Seller: moluna, Greven, Germany
Condition: New. Algebraic theory of parameterized specifications with requirements.- A modal characterisation of observable machine-behaviour.- Trees as data and file structures.- Infinitary relations.- Full approximability of a class of problems over power sets.- How to c. Seller Inventory # 4881109
Quantity: Over 20 available
Seller: ralfs-buecherkiste, Herzfelde, MOL, Germany
Broschur. Condition: Gut. 364 S. Computerwissenschaften Mathematik Mathematics Guter Zustand/ Good. Ex-Library. Brownish paper. ha1082115 Sprache: Englisch Gewicht in Gramm: 650. Seller Inventory # 397774
Seller: AHA-BUCH GmbH, Einbeck, Germany
Taschenbuch. Condition: Neu. Neuware - Algebraic theory of parameterized specifications with requirements.- A modal characterisation of observable machine-behaviour.- Trees as data and file structures.- Infinitary relations.- Full approximability of a class of problems over power sets.- How to compute generators for the intersection of subgroups in free groups.- Abstract data types and rewriting systems : Application to the programming of Algebraic Abstract Data Types in PROLOG.- Top-down tree-transducers for infinite trees I.- Easy solutions are hard to find.- Une semantique pour les arbres non deterministes.- On the algebraic specification of nondeterministic programming languages.- Applied tree enumerations.- Evaluation d'arbre pour un calcul formel (application a l'enumeration de proteines).- On pushdown tree automata.- Initial and terminal algebra semantics of parameterized abstract data type specifications with inequalities.- Calcul du rang des -arbres infinis regulers.- A class of tree-like UNION-FIND data structures and the nonlinearity.- Grammars without erasing rules. the OI case.- Proprietes de cloture d'une extension de transducteurs d'arbres deterministes.- Certain algorithms for subgraph isomorphism problems.- A # P-complete problem over arithmetical trees.- Trees in Kripke models and in an intuitionistic refutation system.- Efficient optimization of monotonic functions on trees.- Differents types de derivations infinies dans les grammaires algebriques d'arbres.- Discriminability of infinite sets of terms in the D -models of the -calculus. Seller Inventory # 9783540108283