Seller: GuthrieBooks, Spring Branch, TX, U.S.A.
Paperback. Condition: Very Good. We are unable to ship to Canada at this time.Ex-library paperback in very nice condition with the usual markings and attachments.
Published by Springer 13.06.2008., 2008
ISBN 10: 3540100032 ISBN 13: 9783540100034
Language: English
Seller: NEPO UG, Rüsselsheim am Main, Germany
£ 34.17
Convert currencyQuantity: 1 available
Add to basketCondition: Gut. Auflage: 1980. 688 Seiten Exemplar aus einer wissenchaftlichen Bibliothek Sprache: Englisch Gewicht in Gramm: 2066 23,5 x 15,5 x 3,9 cm, Taschenbuch.
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Condition: New.
Seller: Best Price, Torrance, CA, U.S.A.
Condition: New. SUPER FAST SHIPPING.
Seller: Ria Christie Collections, Uxbridge, United Kingdom
£ 47.13
Convert currencyQuantity: Over 20 available
Add to basketCondition: New. In.
Seller: Lucky's Textbooks, Dallas, TX, U.S.A.
Condition: New.
Seller: Chiron Media, Wallingford, United Kingdom
£ 45.98
Convert currencyQuantity: 10 available
Add to basketPF. Condition: New.
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Condition: As New. Unread book in perfect condition.
Seller: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Ireland
£ 85.72
Convert currencyQuantity: 15 available
Add to basketCondition: New. 1980. Paperback. . . . . .
Published by Springer Berlin Heidelberg, 1980
ISBN 10: 3540100032 ISBN 13: 9783540100034
Language: English
Seller: AHA-BUCH GmbH, Einbeck, Germany
£ 45.11
Convert currencyQuantity: 1 available
Add to basketTaschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - How to get rid of pseudoterminals.- Test sets for homomorphism equivalence on context free languages.- Languages with homomorphic replacements.- Functions equivalent to integer multiplication.- Languages with reducing reflexive types.- Semantics of unbounded nondeterminism.- A shifting algorithm for min-max tree partitioning.- A characterisation of computable data types by means of a finite equational specification method.- A note on sweeping automata.- Border rank of a p¿¿ tensor and the optimal approximation of a pair of bilinear forms.- Derivations et reductions dans les grammaires algebrioues.- Semantic analysis of communicating sequential processes.- Dos systems and languages.- Algebraic implementation of abstract data types: concept, syntax, semantics and correctness.- Parameterized data types in algebraic specification languages.- Characterizing correctness properties of parallel programs using fixpoints.- Formal properties of one-visit and multi-pass attribute grammars (extended abstract).- Cryptocomplexity and NP-completeness.- On the analysis of tree-matching algorithms.- Generating and searching sets induced by networks.- The complexity of the inequivalence problem for regular expressions with intersection.- An almost linear time algorithm for computing a dependency basis in a relational data base.- Bipolar synchronization systems.- Testing of properties of finite algebras.- A transaction model.- On observing nondeterminism and concurrency.- Terminal algebra semantics and retractions for abstract data types.- The complexity of semilinear sets.- A theory of nondeterminism.- A representation theorem for models of \*-free PDL.- Present-day Hoare-like systems for programming languages with procedures: Power, limits and most likely extensions.- Symmertric space-bounded computation (extended abstract).- On some properties of local testability.- Semantics :Algebras,fixed points,axioms.- Measuring the expressive power of dynamic logics: An application of abstract model theory.- Pebbling mountain ranges and its application to DCFL-recognition.- Space-restricted attribute grammars.- A constructive approach to compiler correctness.- A worst-case analysis of nearest neighbor searching by projection.- Proprietes syntactiques du produit non ambigu.- On the optimal assignment of attributes to passes in multi-pass attribute evaluators.- Optimal unbounded search strategies.- A 'fast implementation' of a multidimensional storage into a tree storage.- Grammatical families.- Partitioned chain grammars.- An improved program for constructing open hash tables.- On the power of commutativity in cryptography.- Characterizations of the LL(k) property.- Computability in categories.- On the size complexity of monotone formulas.- Reversible computing.- The use of metasystem transition in theorem proving and program optimization.- On the power of real-time turing machines under varying specifications.
Seller: Kennys Bookstore, Olney, MD, U.S.A.
Condition: New. 1980. Paperback. . . . . . Books ship from the US and Ireland.