-
DISPONIBILITÀ IMMEDIATA
{{/disponibilitaBox}}
-
{{speseGratisLibroBox}}
{{/noEbook}}
{{^noEbook}}
-
Libro
-
- Genere: Libro
- Lingua: Inglese
- Editore: Springer Berlin Heidelberg
- Pubblicazione: 08/2009
- Edizione: 2009
Algebraic Informatics
bozapalidis symeon (curatore); rahonis george (curatore)
54,98 €
52,23 €
{{{disponibilita}}}
SOMMARIO
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.ALTRE INFORMAZIONI
- Condizione: Nuovo
- ISBN: 9783642035630
- Collana: Lecture Notes in Computer Science
- Dimensioni: 235 x 155 mm Ø 569 gr
- Formato: Brossura
- Illustration Notes: X, 361 p.
- Pagine Arabe: 361
- Pagine Romane: x