Order Total (1 Item Items):
Shipping Destination:
Jantzen, Matthias (68 results)
Skip to main search results
Search filters
Product Type
- All Product Types
- Books (68)
- Magazines & Periodicals (No further results match this refinement)
- Comics (No further results match this refinement)
- Sheet Music (No further results match this refinement)
- Art, Prints & Posters (No further results match this refinement)
- Photographs (No further results match this refinement)
- Maps (No further results match this refinement)
- Manuscripts & Paper Collectibles (No further results match this refinement)
Condition Learn more
- New (53)
- As New, Fine or Near Fine (10)
- Very Good or Good (3)
- Fair or Poor (No further results match this refinement)
- As Described (2)
Binding
Collectible Attributes
- First Edition (No further results match this refinement)
- Signed (No further results match this refinement)
- Dust Jacket (No further results match this refinement)
- Seller-Supplied Images (34)
- Not Print on Demand (54)
Language (2)
Free Shipping
Seller Location
Seller Rating
-
Foundations of Computer Science: Potential-Theory-Cognition (Lecture Notes in Computer Science, Volume 1337)
Seller: Zubal-Books, Since 1961, Cleveland, OH, U.S.A.
Seller rating 5 out of 5 stars
Condition: Fine. Price has been reduced by 10% until Monday, Oct. 20 (sale item) 514 pp., paperback, fine. - If you are reading this, this item is actually (physically) in our stock and ready for shipment once ordered. We are not bookjackers. Buyer is responsible for any additional duties, taxes, or fees required by recipient's country.
-
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. Text block clean and unmarked. Tight binding.
-
Foundations of Computer Science: Potential-Theory-Cognition
Published by Springer Berlin Heidelberg, 2010
ISBN 10: 354063746X ISBN 13: 9783540637462
Language: English
Softcover. Condition: Très bon. Ancien livre de bibliothèque. Salissures sur la tranche. Edition 2010. Ammareal reverse jusqu'à 15% du prix net de cet article à des organisations caritatives. ENGLISH DESCRIPTION Book Condition: Used, Very good. Former library book. Stains on the edge. Edition 2010. Ammareal gives back up to 15% of this item's net price to charity organizations.
-
Confluent String Rewriting
Seller: Attic Books (ABAC, ILAB), London, ON, Canada
Seller rating 5 out of 5 stars
Hardcover. Condition: Very good +. EATCS Monographs on Theoretical Computer Science. viii, 126 p. 25 cm. Dents in bottom of front board. Ink signature in bottom of front board.
-
£ 16.30
Convert currency£ 12.94 shipping from United Kingdom to U.S.A.Quantity: 1 available
Add to basketCondition: Good. This is an ex-library book and may have the usual library/used-book markings inside.This book has soft covers. In good all round condition. Please note the Image in this listing is a stock photo and may not match the covers of the actual item,800grams, ISBN:9783540637462.
-
Condition: New.
-
Confluent String Rewriting (Paperback)
Published by Springer-Verlag Berlin and Heidelberg GmbH & Co. KG, Berlin, 2011
ISBN 10: 3642648673 ISBN 13: 9783642648670
Language: English
Paperback. Condition: new. Paperback. Replacement systems, such as term rewriting systems, tree manipulat ing systems, and graph grammars, have been used in Computer Science in the context of theorem proving, program optimization, abstract data types, algebraic simplification, and symbolic comput ation. Replacement systems for strings arose about seventy years earlier in the area of combinatory logic and group theory. The most natural and appropriate formalism for dealing with string rewriting is the notion of a semi-Thue system and this monograph treats its central aspects. The reduction relation is here defined firstly by the direction of the rules and secondly by some metric that yields efficient algorithms. These systems are general enough to discuss the basic notions of arbitrary replacement systems, such as termination, confluence, and the Church-Rosser property in its original meaning. Confluent semi-Thue systems in which each and every derivation consists of finitely many steps only are called complete; they guarantee the existence of unique normal forms as canonical representatives of the Thue congruence classes. Each such system can be considered a nondeterministic algorithm for the word problem which works correctly without backtracking. This is often conceptually simpler and more elegant than an ad hoc construction. In many cases a replace ment system can be altered to a complete system by the Knuth-Bendix completion method. Replacement systems, such as term rewriting systems, tree manipulat ing systems, and graph grammars, have been used in Computer Science in the context of theorem proving, program optimization, abstract data types, algebraic simplification, and symbolic comput ation. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.
-
Condition: New.
-
Condition: New.
-
Confluent String Rewriting (Hardcover)
Published by Springer-Verlag Berlin and Heidelberg GmbH & Co. KG, Berlin, 1988
ISBN 10: 3540137157 ISBN 13: 9783540137153
Language: English
Hardcover. Condition: new. Hardcover. This monograph treats comprehensively central aspects of string rewriting systems in the form of semi-Thue systems. These are so general as to enable the discussion of all the basic notions and questions that arise in arbitrary replacement systems as used in various areas of computer science. The Church-Rosser property is used in its original meaning and the existence of complete monoid and group presentations is the central point of discussion. Decidability problems with their complexity are surveyed and congruential languages including the deterministic context-free NTS languages are discussed. The book contains a number of generalizations of results published elsewhere, e. g. , the uniqueness of complete string rewriting systems with respect to the underlying order. Completely new and unpublished results which serve as an exposition of techniques and new methods are discussed in detail. With the help of semi-Thue systems it is shown in which situations the famous Knuth-Bendix completion method does not terminate and why, and that in general complete replacement systems cannot always be used as algorithms to solve the word problem.It is suggested how these situations can be stated by using a certain control under which the rewriting is to be performed. This monograph is a reference for graduate students and active researchers in theoretical computer science. The reader is led to the forefront of current research in the area of string rewriting and monoid presentations. Replacement systems, such as term rewriting systems, tree manipulat ing systems, and graph grammars, have been used in Computer Science in the context of theorem proving, program optimization, abstract data types, algebraic simplification, and symbolic comput ation. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.
-
Condition: New.
-
Condition: As New. Unread book in perfect condition.
-
Condition: As New. Unread book in perfect condition.
-
Confluent String Rewriting (Monographs in Theoretical Computer Science. An EATCS Series)
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
£ 47.87
Convert currency£ 11.98 shipping from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketCondition: New. In.
-
Confluent String Rewriting (Monographs in Theoretical Computer Science. An EATCS Series, 14)
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
£ 49.13
Convert currency£ 11.98 shipping from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketCondition: New. In.
-
Confluent String Rewriting - EATCS Monographs on Theoretical Computer Science
Published by Springer 1988, 1988
Seller: Andere Welten Medienvertriebs GmbH, Ahrensburg, SH, Germany
Seller rating 3 out of 5 stars
£ 26.89
Convert currency£ 13.05 shipping from Germany to U.S.A.Quantity: 1 available
Add to basketHardcover Sehr gut erhalten.
-
£ 47.38
Convert currency£ 15.49 shipping from United Kingdom to U.S.A.Quantity: 10 available
Add to basketPF. Condition: New.
-
Confluent String Rewriting
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Seller rating 5 out of 5 stars
£ 49.12
Convert currency£ 15 shipping from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketCondition: New.
-
Condition: New. pp. 140.
-
Condition: New. pp. 140.
-
Confluent String Rewriting
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Seller rating 5 out of 5 stars
£ 55.74
Convert currency£ 15 shipping from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketCondition: As New. Unread book in perfect condition.
-
Hardback or Cased Book. Condition: New. Confluent String Rewriting. Book.
-
Confluent String Rewriting
Published by Springer Berlin Heidelberg, 2011
ISBN 10: 3642648673 ISBN 13: 9783642648670
Language: English
£ 42.34
Convert currency£ 42.63 shipping from Germany to U.S.A.Quantity: Over 20 available
Add to basketCondition: New.
-
Condition: New.
-
STACS 91 (Paperback)
Published by Springer-Verlag Berlin and Heidelberg GmbH & Co. KG, Berlin, 1991
ISBN 10: 3540537090 ISBN 13: 9783540537090
Language: English
Paperback. Condition: new. Paperback. This volume contains the proceedings of STACS 91, a symposium on the theoretical aspects of computer science, held in Hamburg, Germany in February 1991. STACS is held each year, alternately in Germany and France, and is organized jointly by the Special Interest Group for Theoretical Computer Science of the Gesellschaft fuer Informatik (GI) and the Special Interest Group for Applied Mathematics of the Association Francaise des Sciences et Techniques de l'Information et de Systemes (AFCET). The topics covered in this volume include abstract data types, algorithms and data structures, automata and formal languages, complexity of concrete algorithms, computational geometry, cryptography, computer systems theory, logic and semantics, mathematics of computation, program specification, theory of parallel and distributed computation, structural complexity, theory of robotics, VLSI structures, and the theory of databases. The proceedings of a symposium on the theoretical aspects of computer science are presented in this volume, which covers such topics as abstract data types, automata and formal languages, computational geometry, logic and semantics, robotics, VLSI structures, cryptography and systems theory. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.
-
Condition: New.
-
Foundations of Computer Science (Paperback)
Published by Springer-Verlag Berlin and Heidelberg GmbH & Co. KG, Berlin, 1997
ISBN 10: 354063746X ISBN 13: 9783540637462
Language: English
Paperback. Condition: new. Paperback. This book constitutes an anthology of refereed papers arranged to acknowledge the work of Wilfried Brauer on the occasion of his sixtieth birthday. The volume presents 49 revised refereed papers organized in topical sections on computer science and its potential, social implications of computer science, formal languages and automata, structures and complexity theory, Petri nets, systems analysis and distributed systems, software engineering and verification, cognition and artificial intelligence, knowledge representation and reasoning, machine learning, neural networks and robotics, language and information systems. An anthology of refereed papers, arranged to acknowledge the work of Wilfried Brauer. It contains 49 papers organized in topical sections on subjects such as computer science and its potential, structures and complexity theory, Petri nets, systems analysis and distributed systems. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.
-
Condition: New.
-
Condition: New.
-
Condition: New.
