2001, ISBN: 9783540105763
[ED: Taschenbuch], [PU: Springer Berlin Heidelberg], Neuware - InhaltsangabeOn the subword complexity and square-freeness of formal languages.- Cycle-free IN-algebraic systems.- On the he… mais…
| booklooker.de BuchWeltWeit Inh. Ludwig Meier e.K. Custos de envio:Versandkostenfrei, Versand nach Deutschland. (EUR 0.00) Details... |
1981, ISBN: 9783540105763
Livro de bolso
[ED: Kartoniert / Broschiert], [PU: Springer Berlin Heidelberg], Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. On the subword complexity… mais…
| booklooker.de |
1981, ISBN: 354010576X
1981 Kartoniert / Broschiert Algorithmus, Mathematik, Theoretische Informatik, Systemanalyse und -design, Alphabet; Boolean function; Informatik; algorithm; algorithms; automata; comple… mais…
| Achtung-Buecher.de MARZIES.de Buch- und Medienhandel, 14621 Schönwalde-Glien Custos de envio:Versandkostenfrei innerhalb der BRD. (EUR 0.00) Details... |
ISBN: 9783540105763
Theoretical Computer Science,P Deussen Trade Books>Trade Paperback>Technology>Xxxsoftware Engr>* Desc Unknown, Springer Berlin Heidelberg Core >1
| BarnesandNoble.com new in stock. Custos de envio:zzgl. Versandkosten., mais custos de envio Details... |
1981, ISBN: 9783540105763
Livro de bolso
5th GI-Conference Karlsruhe, March 23-25, 1981, Buch, Softcover, [PU: Springer Berlin], Springer Berlin, 1981
| lehmanns.de Custos de envio:Versand in 7-10 Tagen. (EUR 0.00) Details... |
2001, ISBN: 9783540105763
[ED: Taschenbuch], [PU: Springer Berlin Heidelberg], Neuware - InhaltsangabeOn the subword complexity and square-freeness of formal languages.- Cycle-free IN-algebraic systems.- On the he… mais…
1981, ISBN: 9783540105763
Livro de bolso
[ED: Kartoniert / Broschiert], [PU: Springer Berlin Heidelberg], Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. On the subword complexity… mais…
1981
ISBN: 354010576X
1981 Kartoniert / Broschiert Algorithmus, Mathematik, Theoretische Informatik, Systemanalyse und -design, Alphabet; Boolean function; Informatik; algorithm; algorithms; automata; comple… mais…
ISBN: 9783540105763
Theoretical Computer Science,P Deussen Trade Books>Trade Paperback>Technology>Xxxsoftware Engr>* Desc Unknown, Springer Berlin Heidelberg Core >1
1981, ISBN: 9783540105763
Livro de bolso
5th GI-Conference Karlsruhe, March 23-25, 1981, Buch, Softcover, [PU: Springer Berlin], Springer Berlin, 1981
Dados bibliográficos do melhor livro correspondente
Dados detalhados do livro - Theoretical Computer Science: 5th GI-Conference Karlsruhe, March 23-25, 1981 P. Deussen Editor
EAN (ISBN-13): 9783540105763
ISBN (ISBN-10): 354010576X
Livro de capa dura
Livro de bolso
Ano de publicação: 1981
Editor/Editora: Springer Berlin Heidelberg Core >1
261 Páginas
Peso: 0,421 kg
Livro na base de dados desde 2007-06-01T20:32:06+01:00 (Lisbon)
Página de detalhes modificada pela última vez em 2024-04-15T15:08:38+01:00 (Lisbon)
Número ISBN/EAN: 354010576X
Número ISBN - Ortografia alternativa:
3-540-10576-X, 978-3-540-10576-3
Ortografia alternativa e termos de pesquisa relacionados:
Autor do livro: peter deussen, deuss
Título do livro: german science, 1981 band, theoretical computer science, march, english computer science, welcome karlsruhe, the philosophy the upanishads, karlsruhe 1715 1965
Dados da editora
Autor: P. Deussen
Título: Lecture Notes in Computer Science; Theoretical Computer Science - 5th GI-Conference Karlsruhe, March 23-25, 1981
Editora: Springer; Springer Berlin
266 Páginas
Ano de publicação: 1981-03-01
Berlin; Heidelberg; DE
Língua: Inglês
53,49 € (DE)
54,99 € (AT)
59,00 CHF (CH)
Available
X, 266 p.
BC; Hardcover, Softcover / Informatik, EDV/Informatik; Systemanalyse und -design; Verstehen; Alphabet; Boolean function; Computer; Informatik; algorithm; algorithms; automata; complexity; complexity theory; formal language; algorithm analysis and problem complexity; Computer System Implementation; Theory of Computation; Algorithms; Computer Science Logic and Foundations of Programming; Theoretische Informatik; Algorithmen und Datenstrukturen; EA
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.Outros livros adicionais, que poderiam ser muito similares com este livro:
Último livro semelhante:
9783540081388 [(Dynamics and Thermodynamics of Compressible Fluid Flow)] [By (author) Ascher H. Shapiro] published on (March, 1977) (Ascher H. Shapiro)
< Para arquivar...