Isbn: 9783540105763 - theoretical computer science: 5th gi-conference karlsruhe, march 23-25, 1981: 104 (16 risultati)

Condizione: New.

Paperback or Softback. Condizione: New. Theoretical Computer Science: 5th Gi-Conference Karlsruhe, March 23-25, 1981. Book.

Condizione: New.

Condizione: As New. Unread book in perfect condition.

Condizione: New. In English.

PF. Condizione: New.

Condizione: New.

Condizione: New. pp. 276.

Condizione: As New. Unread book in perfect condition.

Taschenbuch. Condizione: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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.…

Taschenbuch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -InhaltsangabeOn 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. 276 pp. Englisch.…

Condizione: New. Print on Demand pp. 276 49:B&W 6.14 x 9.21 in or 234 x 156 mm (Royal 8vo) Perfect Bound on White w/Gloss Lam.

Condizione: New. PRINT ON DEMAND pp. 276.

Condizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. 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 Funk.…

Taschenbuch. Condizione: Neu. This item is printed on demand - Print on Demand Titel. Neuware -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.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 276 pp. Englisch. …

Taschenbuch. Condizione: Neu. Theoretical Computer Science | 5th GI-Conference Karlsruhe, March 23-25, 1981 | P. Deussen | Taschenbuch | x | Englisch | 1981 | Springer | EAN 9783540105763 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu Print on Demand. …