|
" Theoretical computer science. "
| Document Type
|
:
|
BL
|
| Record Number
|
:
|
735940
|
| Doc. No
|
:
|
b555784
|
| Title & Author
|
:
|
Theoretical computer science.
|
| Publication Statement
|
:
|
Springer Verl., 1979
|
| ISBN
|
:
|
3540091181
|
|
|
:
|
: 9783540091189
|
| 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.
|
| LC Classification
|
:
|
QA267.T446 1979
|
| |