Theoretical computer science : 4th GI Conference, Aachen, March 26-28, 1979
Author(s)
Bibliographic Information
Theoretical computer science : 4th GI Conference, Aachen, March 26-28, 1979
（Lecture notes in computer science, 67）
Springer-Verlag, 1979
- : gw
- : us
Available at / 55 libraries
-
Kobe University Library for Science and Technology
: us548-0-6//67031008805940,
548-0-6//671008805940 -
University of Tsukuba Library, Library on Library and Information Science
: gw007.08:L-49:67881003270
-
The University of Electro-Communications Library研
: gw549.98||L49||67,549.98||L49||67||b,549.98||L49||67||c2217904145,2217905218,2217910241
-
No Libraries matched.
- Remove all filters.
Note
Includes bibliographies
Description and Table of Contents
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 Baumen.- 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 lineaires.- 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.- Uber eine minimale universelle Turing-Maschine.- Sur les varietes de langages et de monoides.- 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 Komplexitat der Presburger Arithmetik und des Aquivalenzproblems einfacher Programme.
by "Nielsen BookData"