Format:
Online-Ressource (VII, 324 S.)
Edition:
Online-Ausg. Berlin [u.a.] Springer 2006 Springer lecture notes archive
ISBN:
9783540355175
Series Statement:
Lecture notes in computer science 67
Content:
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.
Note:
Literaturangaben
,
Beitr. teilw. engl., teilw. franz., teilw. dt.,
Additional Edition:
ISBN 3540091181
Additional Edition:
ISBN 0387091181
Additional Edition:
ISBN 9783540091189
Additional Edition:
Erscheint auch als Druck-Ausgabe Theoretical computer science Berlin [u.a.] : Springer, 1979 ISBN 3540091181
Additional Edition:
ISBN 0387091181
Language:
English
Subjects:
Computer Science
,
Economics
Keywords:
Automatentheorie
;
Formale Sprache
;
Datenverarbeitung
;
Datenverarbeitung
;
Konferenzschrift
DOI:
10.1007/3-540-09118-1
URL:
Volltext
(lizenzpflichtig)
Author information:
Weihrauch, Klaus 1943-
Bookmarklink
