Theoretical Computer Science
4th GI Conference Aachen, March 26-28, 1979
Herausgegeben:Weihrauch, K.
18,99 €
inkl. MwSt.
Versandfertig in 1-2 Wochen
9 °P sammeln
Theoretical Computer Science
4th GI Conference Aachen, March 26-28, 1979
Herausgegeben:Weihrauch, K.
- Broschiertes Buch
Andere Kunden interessierten sich auch für
- JosephFoundations of Software Technology and Theoretical Computer Science39,99 €
- Theoretical Computer Science27,99 €
- Automata Theory and Formal Languages18,99 €
- S. D. BrookesThe Carnegie-Mellon Curriculum for Undergraduate Computer Science39,99 €
- Rechnerstrukturen und Betriebsprogrammierung39,99 €
- Automata, Languages and Programming31,99 €
- Fifth Conference on Optimization Techniques. Rome 197324,99 €
-
-
-
Produktdetails
- Lecture Notes in Computer Science 67
- Verlag: Springer / Springer Berlin Heidelberg / Springer, Berlin
- Artikelnr. des Verlages: 978-3-540-09118-9
- 1979.
- Seitenzahl: 340
- Erscheinungstermin: 5. März 1979
- Deutsch, Englisch, Französisch
- Abmessung: 235mm x 155mm x 19mm
- Gewicht: 481g
- ISBN-13: 9783540091189
- ISBN-10: 3540091181
- Artikelnr.: 23115608
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.
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.