| |
|
|
|
|
|
|
|
|
1. |
Record Nr. |
UNISA996465733003316 |
|
|
Titolo |
Algebraic Informatics [[electronic resource] ] : 3rd International Conference on Algebraic Informatics, CAI 2009, Thessaloniki, Greece, Mai 19-22, 2009 / / edited by Symeon Bozapalidis, George Rahonis |
|
|
|
|
|
|
|
Pubbl/distr/stampa |
|
|
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 |
|
|
|
|
|
|
|
|
|
ISBN |
|
|
|
|
|
|
Edizione |
[1st ed. 2009.] |
|
|
|
|
|
Descrizione fisica |
|
1 online resource (X, 361 p.) |
|
|
|
|
|
|
Collana |
|
Theoretical Computer Science and General Issues, , 2512-2029 ; ; 5725 |
|
|
|
|
|
|
Disciplina |
|
|
|
|
|
|
Soggetti |
|
Computer science |
Computer programming |
Machine theory |
Computer science—Mathematics |
Software engineering |
Computer Science Logic and Foundations of Programming |
Programming Techniques |
Theory of Computation |
Formal Languages and Automata Theory |
Symbolic and Algebraic Manipulation |
Software Engineering |
|
|
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
Note generali |
|
|
|
|
|
|
Nota di contenuto |
|
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. |
|
|
|
|
|
| |