|
|
|
|
| LEADER |
02638nmm a2200313 u 4500 |
| 001 |
EB000654407 |
| 003 |
EBX01000000000000000507489 |
| 005 |
00000000000000.0 |
| 007 |
cr||||||||||||||||||||| |
| 008 |
140122 ||| eng |
| 020 |
|
|
|a 9783540385615
|
| 100 |
1 |
|
|a Deussen, P.
|e [editor]
|
| 245 |
0 |
0 |
|a Theoretical Computer Science
|h Elektronische Ressource
|b 5th GI-Conference Karlsruhe, March 23-25, 1981
|c edited by P. Deussen
|
| 250 |
|
|
|a 1st ed. 1981
|
| 260 |
|
|
|a Berlin, Heidelberg
|b Springer Berlin Heidelberg
|c 1981, 1981
|
| 300 |
|
|
|a X, 266 p
|b online resource
|
| 505 |
0 |
|
|a 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
|
| 653 |
|
|
|a Computer systems
|
| 653 |
|
|
|a Computer Science Logic and Foundations of Programming
|
| 653 |
|
|
|a Computer science
|
| 653 |
|
|
|a Computer System Implementation
|
| 653 |
|
|
|a Algorithms
|
| 653 |
|
|
|a Theory of Computation
|
| 041 |
0 |
7 |
|a eng
|2 ISO 639-2
|
| 989 |
|
|
|b SBA
|a Springer Book Archives -2004
|
| 490 |
0 |
|
|a Lecture Notes in Computer Science
|
| 028 |
5 |
0 |
|a 10.1007/BFb0017288
|
| 856 |
4 |
0 |
|u https://doi.org/10.1007/BFb0017288?nosfx=y
|x Verlag
|3 Volltext
|
| 082 |
0 |
|
|a 004.2
|