Theoretical Computer Science
K. Weihrauch
Sold by BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
AbeBooks Seller since January 11, 2012
New - Soft cover
Condition: New
Ships from Germany to U.S.A.
Quantity: 2 available
Add to basketSold by BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
AbeBooks Seller since January 11, 2012
Condition: New
Quantity: 2 available
Add to basketThis 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
"About this title" may belong to another edition of this title.
Allgemeine Geschäftsbedingungen mit Kundeninformationen
Inhaltsverzeichnis
Geltungsbereich
Vertragsschluss
Widerrufsrecht
Preise und Zahlungsbedingungen
Liefer- und Versandbedingungen
Eigentumsvorbehalt
Mängelhaftung
Anwendbares Recht
Gerichtsstand
Alternative Streitbeilegung
Der Versand ins Ausland findet IMMER mit DHL statt. Auch nach Österreich verschicken wir nur mit DHL! Daher Standardversand == Luftpost!
| Order quantity | 5 to 15 business days | 5 to 15 business days |
|---|---|---|
| First item | US$ 25.88 | US$ 25.88 |
Delivery times are set by sellers and vary by carrier and location. Orders passing through Customs may face delays and buyers are responsible for any associated duties or fees. Sellers may contact you regarding additional charges to cover any increased costs to ship your items.