Theoretical Computer Science: 4th GI Conference Aachen, March 26-28, 1979 by K. WeihrauchTheoretical Computer Science: 4th GI Conference Aachen, March 26-28, 1979 by K. Weihrauch

Theoretical Computer Science: 4th GI Conference Aachen, March 26-28, 1979

EditorK. Weihrauch

Paperback | March 5, 1979

Pricing and Purchase Info

$48.04 online 
$51.95 list price save 7%
Earn 240 plum® points

Prices and offers may vary in store

Quantity:

In stock online

Ships free on orders over $25

Not available in stores

Title:Theoretical Computer Science: 4th GI Conference Aachen, March 26-28, 1979Format:PaperbackDimensions:338 pages, 9.25 × 6.1 × 0.07 inPublished:March 5, 1979Publisher:Springer Berlin HeidelbergLanguage:English

The following ISBNs are associated with this title:

ISBN - 10:3540091181

ISBN - 13:9783540091189

Look for similar items by category:

Reviews

Table of Contents

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.