Algebraic Informatics
Editat de Symeon Bozapalidis, George Rahonisen Limba Engleză Paperback – 28 aug 2009
| Toate formatele și edițiile | Preț | Express |
|---|---|---|
| Paperback (2) | 322.37 lei 6-8 săpt. | |
| Springer – 14 dec 2007 | 322.37 lei 6-8 săpt. | |
| Springer – 28 aug 2009 | 325.83 lei 6-8 săpt. |
Preț: 325.83 lei
Preț vechi: 407.29 lei
-20%
Puncte Express: 489
Preț estimativ în valută:
57.62€ • 66.07$ • 49.80£
57.62€ • 66.07$ • 49.80£
Carte tipărită la comandă
Livrare economică 27 aprilie-11 mai
Specificații
ISBN-13: 9783642035630
ISBN-10: 3642035639
Pagini: 372
Ilustrații: X, 361 p.
Dimensiuni: 155 x 235 x 21 mm
Greutate: 0.56 kg
Ediția:2009
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3642035639
Pagini: 372
Ilustrații: X, 361 p.
Dimensiuni: 155 x 235 x 21 mm
Greutate: 0.56 kg
Ediția:2009
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
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.