Da: GuthrieBooks, Spring Branch, TX, U.S.A.
EUR 3,53
Convertire valutaQuantità: 1 disponibili
Aggiungi al carrelloPaperback. Condizione: 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.
Da: GreatBookPrices, Columbia, MD, U.S.A.
EUR 40,05
Convertire valutaQuantità: 15 disponibili
Aggiungi al carrelloCondizione: New.
Da: Lucky's Textbooks, Dallas, TX, U.S.A.
EUR 38,93
Convertire valutaQuantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
Da: Ria Christie Collections, Uxbridge, Regno Unito
EUR 28,60
Convertire valutaQuantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. In.
Da: GreatBookPrices, Columbia, MD, U.S.A.
EUR 44,70
Convertire valutaQuantità: 15 disponibili
Aggiungi al carrelloCondizione: As New. Unread book in perfect condition.
Da: Hay-on-Wye Booksellers, Hay-on-Wye, HEREF, Regno Unito
EUR 3,73
Convertire valutaQuantità: 1 disponibili
Aggiungi al carrelloCondizione: 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.
Editore: Springer Berlin Heidelberg, 1979
ISBN 10: 3540091181 ISBN 13: 9783540091189
Lingua: Inglese
Da: AHA-BUCH GmbH, Einbeck, Germania
EUR 24,60
Convertire valutaQuantità: 1 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: 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.
Da: Mispah books, Redhill, SURRE, Regno Unito
EUR 69,94
Convertire valutaQuantità: 1 disponibili
Aggiungi al carrelloPaperback. Condizione: Very Good. Very Good. book.