04034nam 22007335 450 99646573300331620230406031045.03-642-03564-710.1007/978-3-642-03564-7(CKB)1000000000772850(SSID)ssj0000316139(PQKBManifestationID)11923460(PQKBTitleCode)TC0000316139(PQKBWorkID)10263455(PQKB)11285680(DE-He213)978-3-642-03564-7(MiAaPQ)EBC3064466(PPN)139950931(EXLCZ)99100000000077285020100301d2009 u| 0engurnn|008mamaatxtccrAlgebraic Informatics[electronic resource] 3rd International Conference on Algebraic Informatics, CAI 2009, Thessaloniki, Greece, Mai 19-22, 2009 /edited by Symeon Bozapalidis, George Rahonis1st ed. 2009.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,2009.1 online resource (X, 361 p.) Theoretical Computer Science and General Issues,2512-2029 ;5725Includes index.3-642-03563-9 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.Theoretical Computer Science and General Issues,2512-2029 ;5725Computer scienceComputer programmingMachine theoryComputer science—MathematicsSoftware engineeringComputer Science Logic and Foundations of ProgrammingProgramming TechniquesTheory of ComputationFormal Languages and Automata TheorySymbolic and Algebraic ManipulationSoftware EngineeringComputer 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.512Bozapalidis Symeonedthttp://id.loc.gov/vocabulary/relators/edtRahonis Georgeedthttp://id.loc.gov/vocabulary/relators/edtCAI 2009BOOK996465733003316Algebraic Informatics2954948UNISA