Cantitate/Preț
Produs

Algebraic Informatics: 3rd International Conference on Algebraic Informatics, CAI 2009, Thessaloniki, Greece, Mai 19-22, 2009: Lecture Notes in Computer Science, cartea 5725

Editat de Symeon Bozapalidis, George Rahonis
en Limba Engleză Paperback – 28 aug 2009

Toate formatele și edițiile

Toate formatele și edițiile Preț Express
Paperback (2) 33372 lei  43-57 zile
  Springer Berlin, Heidelberg – 14 dec 2007 33372 lei  43-57 zile
  Springer Berlin, Heidelberg – 28 aug 2009 33947 lei  43-57 zile

Din seria Lecture Notes in Computer Science

Preț: 33947 lei

Preț vechi: 42434 lei
-20% Nou

Puncte Express: 509

Preț estimativ în valută:
6496 6799$ 5407£

Carte tipărită la comandă

Livrare economică 31 martie-14 aprilie

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783642035630
ISBN-10: 3642035639
Pagini: 372
Ilustrații: X, 361 p.
Dimensiuni: 155 x 235 x 20 mm
Greutate: 0.61 kg
Ediția:2009
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Lecture Notes in Computer Science, Theoretical Computer Science and General Issues

Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

Invited Paper of Werner Kuich.- Cycle-Free Finite Automata in Partial Iterative Semirings.- Tutorials.- Picture Languages: From Wang Tiles to 2D Grammars.- Process Algebra: An Algebraic Theory of Concurrency.- Invited Papers.- On Several Proofs of the Recognizability Theorem.- Theories of Automatic Structures and Their Complexity.- The Graph Programming Language GP.- Canonical Reduction Systems in Symbolic Mathematics.- Contributed Papers.- Solving Norm Form Equations over Number Fields.- A Note on Unambiguity, Finite Ambiguity and Complementation in Recognizable Two-Dimensional Languages.- Context-Free Categorical Grammars.- An Eilenberg Theorem for Pictures.- On the Complexity of the Syntax of Tree Languages.- On the Reversibility of Parallel Insertion, and Its Relation to Comma Codes.- Computation of Pell Numbers of the Form pX 2.- Iteration Grove Theories with Applications.- Combinatorics of Finite Words and Suffix Automata.- Polynomial Operators on Classes of Regular Languages.- Self-dual Codes over Small Prime Fields from Combinatorial Designs.- A Backward and a Forward Simulation for Weighted Tree Automata.- Syntax-Directed Translations and Quasi-alphabetic Tree Bimorphisms — Revisited.- Polynomial Interpolation of the k-th Root of the Discrete Logarithm.- Single-Path Restarting Tree Automata.- Parallel Communicating Grammar Systems with Regular Control.