UID:
almahu_9948621049302882
Format:
X, 266 p.
,
online resource.
Edition:
1st ed. 1981.
ISBN:
9783540385615
Series Statement:
Lecture Notes in Computer Science, 104
Note:
On the subword complexity and square-freeness of formal languages -- Cycle-free IN-algebraic systems -- On the height of syntactical graphs -- Boolean functions whose monotone complexity is of size n2/log n -- Netzwerke zur simultanen Berechnung Boolescher Funktionen (Ausführliche Kurzfassung) -- The computational complexity of bilinear multiplications -- P - complete problems in free groups -- Quelques proprietes des langages a un Compteur -- Un resultat de discontinuite dans les familles de langages -- Verallgemeinerte kommutative Sprachen -- Ein rein automatentheoretischer Aufbau der Theorie der kontext-freien Sarachen -- Un analogue du theoreme des varietes pour les cones et les cylindres -- A family of graphs with expensive depth-reduction -- On ?-balanced binary search trees -- Erzeugung optimalen Codes für Series - Parallel Graphs -- Recent directions in algorithmic research -- Dynamic k-dimensional multiway search under time-varying access frequencies -- Some applications of CFL's over infinite alphabets -- A decidable property of iterated morphisms -- Prefix-preservation for rational partial functions is decidable -- Concurrency and automata on infinite sequences -- An effective retract calculus -- Recursion and complexity theory on CPO-S -- Computable algebras, word problems and canonical term algebras -- Reachability analysis with assertion systems -- Dynamization of decomposable searching problems yielding good worst-case bounds -- Robust balancing in B-trees -- Centers of languages -- (Erasing)* strings.
In:
Springer Nature eBook
Additional Edition:
Printed edition: ISBN 9783662175682
Additional Edition:
Printed edition: ISBN 9783540105763
Language:
English
URL:
https://doi.org/10.1007/BFb0017288
