Theoretical Computer Science : 4th Gi Conference Aachen, March 26-28, 1979
Weihrauch, K. (EDT)
ISBN 10: 3540091181 ISBN 13: 9783540091189
Published by Springer, 1979
Used
Soft cover
From
GreatBookPrices, Columbia, MD, U.S.A.
Seller rating 5 out of 5 stars
AbeBooks Seller since 6 April 2009
This specific item is no longer available.
About this Item
Bibliographic Details
Title: Theoretical Computer Science : 4th Gi ...
Publisher: Springer
Publication Date: 1979
Binding: Soft cover
Condition: As New
Top Search Results from the AbeBooks Marketplace
Stock Image
Theoretical Computer Science: 4th GI Conference Aachen, March 26-28, 1979 (Lecture Notes in Computer Science) (English, German and French Edition)
Seller: GuthrieBooks, Spring Branch, TX, U.S.A.
Seller rating 5 out of 5 stars
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. Seller Inventory # UTD14a-0875
Quantity: 1 available
Stock Image
Theoretical Computer Science: 4th GI Conference Aachen, March 26-28, 1979: 67 (Lecture Notes in Computer Science, 67) [Paperback] Weihrauch, K.
Seller: Hay-on-Wye Booksellers, Hay-on-Wye, HEREF, United Kingdom
Seller rating 5 out of 5 stars
Condition: Good. Some shelfwear; extremities are a little worn. Edges slightly upturned in places. Content of the book is mostly clean throughout, though ink inscription and some staining in places. A readable paperback. Seller Inventory # 001582-9
Quantity: 1 available
Seller Image
Theoretical Computer Science : 4th GI Conference Aachen, March 26-28, 1979
Published by
Springer Berlin Heidelberg, 1979
ISBN 10: 3540091181
ISBN 13: 9783540091189
New
Taschenbuch
Seller: AHA-BUCH GmbH, Einbeck, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - InhaltsangabeContext-free sets of infinite words.- New aspects of homomorphisms.- Can partial correctness assertions specify programming language semantics .- An algebraic theory for synchronization.- Storage modification machines.- Negative results on counting.- Strong non-deterministic context-free languages.- Information content characterizations of complexity theoretic properties.- Mittlere Anzahl von Rebalancierungsoperationen in gewichtsbalancierten Bäumen.- A new recursion induction principle.- Finite-change automata.- Move rules and trade-offs in the pebble game.- Transition diagrams and strict deterministic grammars.- Exact expressions for some randomness tests.- On storage optimization for automatically generated compilers.- On continuous completions.- A new method to show lower bounds for polynomials which are hard to compute.- On zerotesting-bounded multicounter machines.- When are two effectively given domains identical .- Sur deux langages linéaires.- An efficient on-line position tree construction algorithm.- Sorting presorted files.- Node-visit optimal 1 - 2 brother trees.- A graph theoretic approach to determinism versus non-determinism.- Une caracterisation de trois varietes de langages bien connues.- Über eine minimale universelle Turing-Maschine.- Sur les varietes de langages et de monoïdes.- Automaten in planaren graphen.- Theoreme de transversale rationnelle pour les automates a pile deterministes.- On the additive complexity of polynomials and some new lower bounds.- Remarks on the nonexistence of some covering grammars.- Zur Komplexität der Presburger Arithmetik und des Äquivalenzproblems einfacher Programme. Seller Inventory # 9783540091189
Quantity: 1 available
Seller Image
Theoretical Computer Science
Published by
Springer Berlin Heidelberg, J.B. Metzler Mär 1979, 1979
ISBN 10: 3540091181
ISBN 13: 9783540091189
New
Taschenbuch
Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. This item is printed on demand - Print on Demand Titel. Neuware -InhaltsangabeContext-free sets of infinite words.- New aspects of homomorphisms.- Can partial correctness assertions specify programming language semantics .- An algebraic theory for synchronization.- Storage modification machines.- Negative results on counting.- Strong non-deterministic context-free languages.- Information content characterizations of complexity theoretic properties.- Mittlere Anzahl von Rebalancierungsoperationen in gewichtsbalancierten Bäumen.- A new recursion induction principle.- Finite-change automata.- Move rules and trade-offs in the pebble game.- Transition diagrams and strict deterministic grammars.- Exact expressions for some randomness tests.- On storage optimization for automatically generated compilers.- On continuous completions.- A new method to show lower bounds for polynomials which are hard to compute.- On zerotesting-bounded multicounter machines.- When are two effectively given domains identical .- Sur deux langages linéaires.- An efficient on-line position tree construction algorithm.- Sorting presorted files.- Node-visit optimal 1 - 2 brother trees.- A graph theoretic approach to determinism versus non-determinism.- Une caracterisation de trois varietes de langages bien connues.- Über eine minimale universelle Turing-Maschine.- Sur les varietes de langages et de monoïdes.- Automaten in planaren graphen.- Theoreme de transversale rationnelle pour les automates a pile deterministes.- On the additive complexity of polynomials and some new lower bounds.- Remarks on the nonexistence of some covering grammars.- Zur Komplexität der Presburger Arithmetik und des Äquivalenzproblems einfacher Programme.Springer-Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 340 pp. Englisch. Seller Inventory # 9783540091189
Quantity: 1 available
Seller Image
Theoretical Computer Science
Published by
Springer Berlin Heidelberg Mrz 1979, 1979
ISBN 10: 3540091181
ISBN 13: 9783540091189
New
Taschenbuch
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -InhaltsangabeContext-free sets of infinite words.- New aspects of homomorphisms.- Can partial correctness assertions specify programming language semantics .- An algebraic theory for synchronization.- Storage modification machines.- Negative results on counting.- Strong non-deterministic context-free languages.- Information content characterizations of complexity theoretic properties.- Mittlere Anzahl von Rebalancierungsoperationen in gewichtsbalancierten Bäumen.- A new recursion induction principle.- Finite-change automata.- Move rules and trade-offs in the pebble game.- Transition diagrams and strict deterministic grammars.- Exact expressions for some randomness tests.- On storage optimization for automatically generated compilers.- On continuous completions.- A new method to show lower bounds for polynomials which are hard to compute.- On zerotesting-bounded multicounter machines.- When are two effectively given domains identical .- Sur deux langages linéaires.- An efficient on-line position tree construction algorithm.- Sorting presorted files.- Node-visit optimal 1 - 2 brother trees.- A graph theoretic approach to determinism versus non-determinism.- Une caracterisation de trois varietes de langages bien connues.- Über eine minimale universelle Turing-Maschine.- Sur les varietes de langages et de monoïdes.- Automaten in planaren graphen.- Theoreme de transversale rationnelle pour les automates a pile deterministes.- On the additive complexity of polynomials and some new lower bounds.- Remarks on the nonexistence of some covering grammars.- Zur Komplexität der Presburger Arithmetik und des Äquivalenzproblems einfacher Programme. 340 pp. Englisch, Französisch, Deutsch. Seller Inventory # 9783540091189
Quantity: 2 available
Seller Image
Theoretical Computer Science
Published by
Springer Berlin Heidelberg, 1979
ISBN 10: 3540091181
ISBN 13: 9783540091189
New
Softcover
Seller: moluna, Greven, Germany
Seller rating 4 out of 5 stars
Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Context-free sets of infinite words.- New aspects of homomorphisms.- Can partial correctness assertions specify programming language semantics?.- An algebraic theory for synchronization.- Storage modification machines.- Negative results on counting.- Strong. Seller Inventory # 4880344
Quantity: Over 20 available
Stock Image
Theoretical Computer Science: 4th GI Conference Aachen, March 26-28, 1979 (Lecture Notes in Computer Science, 67)
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
Condition: New. In. Seller Inventory # ria9783540091189_new
Quantity: Over 20 available
Stock Image
Theoretical Computer Science: 4th GI Conference Aachen, March 26-28, 1979 (Lecture Notes in Computer Science, 67)
Seller: Lucky's Textbooks, Dallas, TX, U.S.A.
Seller rating 5 out of 5 stars
Condition: New. Seller Inventory # ABLIING23Mar3113020158397
Quantity: Over 20 available
Stock Image
Theoretical Computer Science (Paperback)
Published by
Springer-Verlag Berlin and Heidelberg GmbH & Co. KG, Berlin, 1979
ISBN 10: 3540091181
ISBN 13: 9783540091189
New
Paperback
Seller: Grand Eagle Retail, Bensenville, IL, U.S.A.
Seller rating 5 out of 5 stars
Paperback. Condition: new. Paperback. Shipping may be from multiple locations in the US or from the UK, depending on stock availability. Seller Inventory # 9783540091189
Quantity: 1 available
Stock Image
Theoretical Computer Science: 4th GI Conference Aachen, March 26-28, 1979 (Lecture Notes in Computer Science, 67) (English, German and French Edition)
Seller: Mispah books, Redhill, SURRE, United Kingdom
Seller rating 4 out of 5 stars
Paperback. Condition: Very Good. Very Good. book. Seller Inventory # ERICA80035400911816
Quantity: 1 available