Articoli correlati a Theoretical Computer Science: 5th GI-Conference Karlsruhe,...
Contenuti
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.
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
- EditoreSpringer
- Data di pubblicazione2008
- ISBN 10 354010576X
- ISBN 13 9783540105763
- RilegaturaCopertina flessibile
- LinguaInglese
- Numero di pagine276
- Contatto del produttorenon disponibile
Compra nuovo
Visualizza questo articolo
EUR 48,37
EUR 9,70 per la spedizione da Germania a Italia
Destinazione, tempi e costi
Risultati della ricerca per Theoretical Computer Science: 5th GI-Conference Karlsruhe,...
Immagini fornite dal venditore
Theoretical Computer Science
Print on DemandDa: moluna, Greven, Germania
Valutazione del venditore 5 su 5 stelle
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. Codice articolo 4881006
Quantità: Più di 20 disponibili
Immagini fornite dal venditore
Theoretical Computer Science : 5th GI-Conference Karlsruhe, March 23-25, 1981
Editore:
Springer Berlin Heidelberg, 1981
ISBN 10: 354010576X
ISBN 13: 9783540105763
Nuovo
Taschenbuch
Da: AHA-BUCH GmbH, Einbeck, Germania
Valutazione del venditore 5 su 5 stelle
Taschenbuch. Condizione: 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. Codice articolo 9783540105763
Quantità: 1 disponibili
Immagini fornite dal venditore
Theoretical Computer Science
ISBN 10: 354010576X
ISBN 13: 9783540105763
Nuovo
Taschenbuch
Da: buchversandmimpf2000, Emtmannsberg, BAYE, Germania
Valutazione del venditore 5 su 5 stelle
Taschenbuch. Condizione: Neu. This item is printed on demand - Print on Demand Titel. 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.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 276 pp. Englisch. Codice articolo 9783540105763
Quantità: 1 disponibili
Foto dell'editore
Theoretical Computer Science: 5th GI-Conference Karlsruhe, March 23-25, 1981 (Lecture Notes in Computer Science, 104)
Da: Ria Christie Collections, Uxbridge, Regno Unito
Valutazione del venditore 5 su 5 stelle
Condizione: New. In. Codice articolo ria9783540105763_new
Quantità: Più di 20 disponibili
Foto dell'editore
Theoretical Computer Science: 5th GI-Conference Karlsruhe, March 23-25, 1981 (Lecture Notes in Computer Science, 104)
Da: California Books, Miami, FL, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: New. Codice articolo I-9783540105763
Quantità: Più di 20 disponibili
Immagini fornite dal venditore
Theoretical Computer Science
Editore:
Springer Berlin Heidelberg Mrz 1981, 1981
ISBN 10: 354010576X
ISBN 13: 9783540105763
Nuovo
Taschenbuch
Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germania
Valutazione del venditore 5 su 5 stelle
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, Französisch, Deutsch. Codice articolo 9783540105763
Quantità: 2 disponibili
Foto dell'editore
Theoretical Computer Science
Da: Books Puddle, New York, NY, U.S.A.
Valutazione del venditore 4 su 5 stelle
Condizione: New. pp. 276. Codice articolo 263065890
Quantità: 4 disponibili
Foto dell'editore
Theoretical Computer Science
Print on DemandDa: Majestic Books, Hounslow, Regno Unito
Valutazione del venditore 5 su 5 stelle
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. Codice articolo 5863421
Quantità: 4 disponibili
Foto dell'editore
Theoretical Computer Science
Print on DemandDa: Biblios, Frankfurt am main, HESSE, Germania
Valutazione del venditore 5 su 5 stelle
Condizione: New. PRINT ON DEMAND pp. 276. Codice articolo 183065896
Quantità: 4 disponibili
Foto dell'editore
Theoretical Computer Science : 5th GI-Conference Karlsruhe, March 23-25, 1981
Da: Chiron Media, Wallingford, Regno Unito
Valutazione del venditore 5 su 5 stelle
PF. Condizione: New. Codice articolo 6666-IUK-9783540105763
Quantità: 10 disponibili