Weihrauch K (23 results)

Cloth. Condition: Good+. Retired Colorado College Library copy with usual stamps, penciled markings, and rear pocket. Else clean and tight textblock. Library stamped top edge. Very lightly shelf worn binding. 324pp. Size: 8vo - over 7¾" - 9¾" tall. Mathematics/Graphs, Drawings (illustrator). Ex-Library Hardcover. …

Paperback. Condition: Very Good. Sorry, No international shipping on this item.Ex-library paperback in very nice condition with the usual markings and attachments.

Hardcover. Condition: Very Good. No Jacket. First Edition. A very good copy of the presumed first hard cover edition (no explicit edition or printing statement), lacking a dust-jacket. Previous owner's modest ex-libris stamp to front endsheet, else the text is wholly unmarked, pristine, and the binding and jacket are bright and fresh in appearance. A sharp copy.…

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.

Ed. North-Holland, Amsterdam - 1987, in-8, broché, 99 pages (table des matières sur la photo) Bon état - Pour les envois hors de France, la tafication «livre & brochure» pour les frais de port a disparue.Les frais de port annoncés correspondent à une moyenne. Ils seront calculés au plus juste en fonction du poids de votre article.…

Ed. North-Holland, Amsterdam - 1987, in-8, broché, 104 pages (table des matières sur la photo) Bon état - Pour les envois hors de France, la tafication «livre & brochure» pour les frais de port a disparue.Les frais de port annoncés correspondent à une moyenne. Ils seront calculés au plus juste en fonction du poids de votre article.…

Condition: New. In English.

Condition: As New. Unread book in perfect condition.

Condition: New. pp. 340.

Condition: New. This is a Brand-new US Edition. This Item may be shipped from US or any other country as we have multiple locations worldwide.

Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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 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.…

Condition: Good. Volume 9. This is an ex-library book and may have the usual library/used-book markings inside.This book has hardback 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,1050grams, ISBN:0387137211. …

Mellrichstadt, Eigenverlag ca. 1975. 8 Seiten m. Abbildungen. Orig. Broschur, kl. 8°. Gefaltet. Gut erhalten.

Hardcover. Condition: Very Good. Dust Jacket may NOT BE INCLUDED.CDs may be missing. SHIPS FROM MULTIPLE LOCATIONS. book.

46 S. OBr. Umschl. angeschmutzt u. angerisen. St. a. Umschl. u. Tit. (Schriften d. Naturforscher-Ges. bei d. Univ. Dorpat 4). Sprache: Deutsch 0 gr.

394 pp., num. distribution maps, 4 tabs, br. 8.

Condition: gut. 2015. pages.

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. …

Condition: New. Print on Demand pp. 340 49:B&W 6.14 x 9.21 in or 234 x 156 mm (Royal 8vo) Perfect Bound on White w/Gloss Lam.

Condition: New. PRINT ON DEMAND pp. 340.

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. …

Taschenbuch. Condition: Neu. This item is printed on demand - Print on Demand Titel. Neuware -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 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 KG, Sachsenplatz 4-6, 1201 Wien 340 pp. Englisch.…

Taschenbuch. Condition: Neu. Theoretical Computer Science | 4th GI Conference Aachen, March 26-28, 1979 | K. Weihrauch | Taschenbuch | vii | Englisch | 1979 | Springer | EAN 9783540091189 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu Print on Demand. …