Items related to Theoretical Computer Science: 5th GI-Conference Karlsruhe,...
Theoretical Computer Science: 5th GI-Conference Karlsruhe, March 23-25, 1981 (Lecture Notes in Computer Science, 104) - Softcover
- PublisherSpringer
- Publication date1981
- ISBN 10 354010576X
- ISBN 13 9783540105763
- BindingPaperback
- LanguageEnglish
- Number of pages276
- EditorDeussen P.
Search results for Theoretical Computer Science: 5th GI-Conference Karlsruhe,...
Stock Image
Theoretical Computer Science: 5th GI-Conference Karlsruhe, March 23-25, 1981 (Lecture Notes in Computer Science, 104)
Seller: Lucky's Textbooks, Dallas, TX, U.S.A.
Seller rating 5 out of 5 stars
Condition: New. Seller Inventory # ABLIING23Mar3113020159030
Quantity: Over 20 available
Stock Image
Theoretical Computer Science: 5th GI-Conference Karlsruhe, March 23-25, 1981 (Lecture Notes in Computer Science, 104)
Seller: California Books, Miami, FL, U.S.A.
Seller rating 5 out of 5 stars
Condition: New. Seller Inventory # I-9783540105763
Quantity: Over 20 available
Stock Image
Theoretical Computer Science: 5th GI-Conference Karlsruhe, March 23-25, 1981 (Lecture Notes in Computer Science, 104)
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
Condition: New. In. Seller Inventory # ria9783540105763_new
Quantity: Over 20 available
Stock Image
Theoretical Computer Science
Seller: Books Puddle, New York, NY, U.S.A.
Seller rating 4 out of 5 stars
Condition: New. pp. 276. Seller Inventory # 263065890
Quantity: 4 available
Seller Image
Theoretical Computer Science : 5th GI-Conference Karlsruhe, March 23-25, 1981
Published by
Springer Berlin Heidelberg, 1981
ISBN 10: 354010576X
ISBN 13: 9783540105763
New
Taschenbuch
Seller: AHA-BUCH GmbH, Einbeck, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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. Seller Inventory # 9783540105763
Quantity: 1 available
Stock Image
Theoretical Computer Science
Print on DemandSeller: Majestic Books, Hounslow, United Kingdom
Seller rating 5 out of 5 stars
Condition: 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. Seller Inventory # 5863421
Quantity: 4 available
Stock Image
Theoretical Computer Science : 5th GI-Conference Karlsruhe, March 23-25, 1981
Seller: Chiron Media, Wallingford, United Kingdom
Seller rating 5 out of 5 stars
PF. Condition: New. Seller Inventory # 6666-IUK-9783540105763
Quantity: 10 available
Stock Image
Theoretical Computer Science
Print on DemandSeller: Biblios, Frankfurt am main, HESSE, Germany
Seller rating 5 out of 5 stars
Condition: New. PRINT ON DEMAND pp. 276. Seller Inventory # 183065896
Quantity: 4 available
Seller Image
Theoretical Computer Science
Published by
Springer Berlin Heidelberg, 1981
ISBN 10: 354010576X
ISBN 13: 9783540105763
New
Softcover
Seller: moluna, Greven, Germany
Seller rating 5 out of 5 stars
Condition: 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. Seller Inventory # 4881006
Quantity: Over 20 available
Seller Image
Theoretical Computer Science
Published by
Springer Berlin Heidelberg Mrz 1981, 1981
ISBN 10: 354010576X
ISBN 13: 9783540105763
New
Taschenbuch
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: 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, Französisch, Deutsch. Seller Inventory # 9783540105763
Quantity: 2 available