Theoretical Computer Science: 5th GI-Conference Karlsruhe, March 23–25, 1981

On the subword complexity and square-freeness of formal languages....Pages 1-4
Cycle-free IN-algebraic systems....Pages 5-12
On the height of syntactical graphs....Pages 13-21
Boolean functions whose monotone complexity is of size n 2 /log n....Pages 22-31
Netzwerke zur simultanen Berechnung Boolescher Funktionen (Ausführliche Kurzfassung)....Pages 32-40
The computational complexity of bilinear multiplications....Pages 41-41
P — complete problems in free groups....Pages 42-51
Quelques proprietes des langages a un Compteur....Pages 52-63
Un resultat de discontinuite dans les familles de langages....Pages 64-69
Verallgemeinerte kommutative Sprachen....Pages 70-75
Ein rein automatentheoretischer Aufbau der Theorie der kontext-freien Sarachen....Pages 76-77
Un analogue du theoreme des varietes pour les cones et les cylindres....Pages 78-90
A family of graphs with expensive depth-reduction....Pages 91-97
On α-balanced binary search trees....Pages 98-108
Erzeugung optimalen Codes für Series — Parallel Graphs....Pages 109-122
Recent directions in algorithmic research....Pages 123-134
Dynamic k-dimensional multiway search under time-varying access frequencies....Pages 135-145
Some applications of CFL's over infinite alphabets....Pages 146-151
A decidable property of iterated morphisms....Pages 152-158
Prefix-preservation for rational partial functions is decidable....Pages 159-166
Concurrency and automata on infinite sequences....Pages 167-183
An effective retract calculus....Pages 184-194
Recursion and complexity theory on CPO-S....Pages 195-202
Computable algebras, word problems and canonical term algebras....Pages 203-213
Reachability analysis with assertion systems....Pages 214-223
Dynamization of decomposable searching problems yielding good worst-case bounds....Pages 224-233
Robust balancing in B-trees....Pages 234-244
Centers of languages....Pages 245-251
(Erasing)* strings....Pages 252-260