Automata, Languages and Programming: Seventh Colloquium, Noordwijkerhout, The Netherlands, July 14-18, 1980. Proceedings (Lecture Notes in Computer Science, 85)

ISBN 10: 3540100032 ISBN 13: 9783540100034
Published by Springer, 1980
New Soft cover

From Ria Christie Collections, Uxbridge, United Kingdom Seller rating 5 out of 5 stars 5-star rating, Learn more about seller ratings

AbeBooks Seller since March 25, 2015

This specific item is no longer available.

About this Item

Description:

In. Seller Inventory # ria9783540100034_new

Report this item

Bibliographic Details

Title: Automata, Languages and Programming: Seventh...
Publisher: Springer
Publication Date: 1980
Binding: Soft cover
Condition: New

Top Search Results from the AbeBooks Marketplace

Seller Image

DE BAKKER, J. W.; VAN LEEUWEN, J. (eds.)
Published by Springer, Berlin, 1980
ISBN 10: 3540100032 ISBN 13: 9783540100034
Used Softcover

Seller: Attic Books (ABAC, ILAB), London, ON, Canada

Seller rating 5 out of 5 stars 5-star rating, Learn more about seller ratings

Softcover. Condition: ex library-good. Lecture Notes in Computer Science 85. viii, 671 p. 24 cm. B&w figures. Paperback. Ex library with labels on spine and inside rear cover. Ink stamps on top edge and title. Pages browning. Seventh Colloquium, Noordwijkerhout, Netherlands, July 14-18, 1980. Seller Inventory # 148872

Contact seller

Buy Used

US$ 25.00
US$ 15.00 shipping
Ships from Canada to U.S.A.

Quantity: 1 available

Add to basket

Seller Image

Bakker, J. W. De and J. van Leeuwen
Published by Springer 13.06.2008., 2008
ISBN 10: 3540100032 ISBN 13: 9783540100034
Used Softcover

Seller: NEPO UG, Rüsselsheim am Main, Germany

Seller rating 5 out of 5 stars 5-star rating, Learn more about seller ratings

Condition: 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 Inventory # 368175

Contact seller

Buy Used

US$ 46.06
US$ 28.18 shipping
Ships from Germany to U.S.A.

Quantity: 1 available

Add to basket

Seller Image

Bakker, Jacobus W. de|Leeuwen, Jan van
Published by Springer Berlin Heidelberg, 1980
ISBN 10: 3540100032 ISBN 13: 9783540100034
New Softcover
Print on Demand

Seller: moluna, Greven, Germany

Seller rating 4 out of 5 stars 4-star rating, Learn more about seller ratings

Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. 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 unbounde. Seller Inventory # 4880741

Contact seller

Buy New

US$ 55.31
US$ 57.52 shipping
Ships from Germany to U.S.A.

Quantity: Over 20 available

Add to basket

Stock Image

Bakker, J. W. de [Editor]; Leeuwen, J. van [Editor];
Published by Springer, 2008
ISBN 10: 3540100032 ISBN 13: 9783540100034
Used Paperback

Seller: GuthrieBooks, Spring Branch, TX, U.S.A.

Seller rating 5 out of 5 stars 5-star rating, Learn more about seller ratings

Paperback. Condition: Very Good. Ex-library paperback in very nice condition with the usual markings and attachments. Seller Inventory # UTD14a-0857

Contact seller

Buy Used

US$ 56.50
US$ 6.99 shipping
Ships within U.S.A.

Quantity: 1 available

Add to basket

Seller Image

J. W. De Bakker (u. a.)
Published by Springer, 1980
ISBN 10: 3540100032 ISBN 13: 9783540100034
New Taschenbuch

Seller: preigu, Osnabrück, Germany

Seller rating 5 out of 5 stars 5-star rating, Learn more about seller ratings

Taschenbuch. Condition: Neu. Automata, Languages and Programming | Seventh Colloquium, Noordwijkerhout, The Netherlands, July 14-18, 1980. Proceedings | J. W. De Bakker (u. a.) | Taschenbuch | x | Englisch | 1980 | Springer | EAN 9783540100034 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu. Seller Inventory # 101946086

Contact seller

Buy New

US$ 57.56
US$ 82.18 shipping
Ships from Germany to U.S.A.

Quantity: 5 available

Add to basket

Seller Image

J. Van Leeuwen
ISBN 10: 3540100032 ISBN 13: 9783540100034
New Taschenbuch
Print on Demand

Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany

Seller rating 5 out of 5 stars 5-star rating, Learn more about seller ratings

Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 684 pp. Englisch. Seller Inventory # 9783540100034

Contact seller

Buy New

US$ 60.80
US$ 27.00 shipping
Ships from Germany to U.S.A.

Quantity: 2 available

Add to basket

Seller Image

J. Van Leeuwen
ISBN 10: 3540100032 ISBN 13: 9783540100034
New Taschenbuch
Print on Demand

Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germany

Seller rating 5 out of 5 stars 5-star rating, Learn more about seller ratings

Taschenbuch. Condition: Neu. This item is printed on demand - Print on Demand Titel. Neuware -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.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 684 pp. Englisch. Seller Inventory # 9783540100034

Contact seller

Buy New

US$ 60.80
US$ 70.44 shipping
Ships from Germany to U.S.A.

Quantity: 1 available

Add to basket

Seller Image

J. Van Leeuwen
Published by Springer Berlin Heidelberg, 1980
ISBN 10: 3540100032 ISBN 13: 9783540100034
New Taschenbuch

Seller: AHA-BUCH GmbH, Einbeck, Germany

Seller rating 5 out of 5 stars 5-star rating, Learn more about seller ratings

Taschenbuch. 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 Inventory # 9783540100034

Contact seller

Buy New

US$ 60.80
US$ 76.43 shipping
Ships from Germany to U.S.A.

Quantity: 1 available

Add to basket

Stock Image

Bakker, J. W. de
Published by Springer 1980-06, 1980
ISBN 10: 3540100032 ISBN 13: 9783540100034
New PF

Seller: Chiron Media, Wallingford, United Kingdom

Seller rating 4 out of 5 stars 4-star rating, Learn more about seller ratings

PF. Condition: New. Seller Inventory # 6666-IUK-9783540100034

Contact seller

Buy New

US$ 63.43
US$ 20.74 shipping
Ships from United Kingdom to U.S.A.

Quantity: 10 available

Add to basket

Stock Image

Published by Springer, 1980
ISBN 10: 3540100032 ISBN 13: 9783540100034
New Softcover

Seller: Lucky's Textbooks, Dallas, TX, U.S.A.

Seller rating 5 out of 5 stars 5-star rating, Learn more about seller ratings

Condition: New. Seller Inventory # ABLIING23Mar3113020158777

Contact seller

Buy New

US$ 75.80
US$ 3.99 shipping
Ships within U.S.A.

Quantity: Over 20 available

Add to basket

There are 4 more copies of this book

View all search results for this book