Theoretical Computer Science [[electronic resource] ] : 5th GI-Conference Karlsruhe, March 23-25, 1981 / / herausgegeben von P. Deussen

• Pubblicazione: Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1981
• Edizione: 1st ed. 1981.
• Descrizione fisica: 1 online resource (X, 266 p.)
• Disciplina: 003.3
• Soggetto topico: Architecture, Computer; Computers; Algorithms; Computer logic; Computer System Implementation; Computation by Abstract Devices; Algorithm Analysis and Problem Complexity; Logics and Meanings of Programs
• Persona (resp. second.): DeussenP
• Note generali: Bibliographic Level Mode of Issuance: Monograph
• Nota di contenuto: 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.
• Titolo autorizzato: Theoretical computer science
• ISBN: 3-540-38561-4
• Formato: Materiale a stampa
• Livello bibliografico: Monografia
• Lingua di pubblicazione: Inglese
• Record Nr.: 996465512103316
• Lo trovi qui: Univ. di Salerno
• Serie: Lecture Notes in Computer Science, . 0302-9743 ; ; 104