Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
Algebraic Informatics [[electronic resource] ] : 3rd International Conference on Algebraic Informatics, CAI 2009, Thessaloniki, Greece, Mai 19-22, 2009 / / edited by Symeon Bozapalidis, George Rahonis
| Algebraic Informatics [[electronic resource] ] : 3rd International Conference on Algebraic Informatics, CAI 2009, Thessaloniki, Greece, Mai 19-22, 2009 / / edited by Symeon Bozapalidis, George Rahonis |
| Edizione | [1st ed. 2009.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 |
| Descrizione fisica | 1 online resource (X, 361 p.) |
| Disciplina | 512 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
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 |
| ISBN | 3-642-03564-7 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| 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. |
| Record Nr. | UNISA-996465733003316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Algebraic Informatics [[electronic resource] ] : Second International Conference, CAI 2007, Thessalonkik, Greece, May 21-25, 2007, Revised Selected and Invited Papers / / edited by Symeon Bozapalidis, George Rahonis
| Algebraic Informatics [[electronic resource] ] : Second International Conference, CAI 2007, Thessalonkik, Greece, May 21-25, 2007, Revised Selected and Invited Papers / / edited by Symeon Bozapalidis, George Rahonis |
| Edizione | [1st ed. 2007.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007 |
| Descrizione fisica | 1 online resource (VIII, 289 p.) |
| Disciplina | 004.0151 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Algebra Machine theory Software engineering Computer science—Mathematics Theory of Computation Computer Science Logic and Foundations of Programming Formal Languages and Automata Theory Software Engineering Symbolic and Algebraic Manipulation |
| ISBN | 3-540-75414-8 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Papers -- On Generalizations of Weighted Finite Automata and Graphics Applications -- Sturmian and Episturmian Words -- From Tree-Based Generators to Delegation Networks -- Bifinite Chu Spaces -- Tiling Recognizable Two-Dimensional Languages -- Algebraic Methods in Quantum Informatics -- Recognizable vs. Regular Picture Languages -- From Algebraic Graph Transformation to Adhesive HLR Categories and Systems -- Contributed Papers -- Deterministic Two-Dimensional Languages over One-Letter Alphabet -- Recognizable Picture Languages and Polyominoes -- An Algebra for Tree-Based Music Generation -- Aperiodicity in Tree Automata -- The Syntactic Complexity of Eulerian Graphs -- Learning Deterministically Recognizable Tree Series — Revisited -- The Second Eigenvalue of Random Walks On Symmetric Random Intersection Graphs -- Verifying Security Protocols for Sensor Networks Using Algebraic Specification Techniques -- Nonassociativity à la Kleene -- Restarting Tree Automata and Linear Context-Free Tree Languages. |
| Record Nr. | UNISA-996465436803316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||