LEADER 04034nam  22007335  450 
001 996465733003316
005 20230406031045.0
010   $a3-642-03564-7
024 7 $a10.1007/978-3-642-03564-7
035   $a(CKB)1000000000772850
035   $a(SSID)ssj0000316139
035   $a(PQKBManifestationID)11923460
035   $a(PQKBTitleCode)TC0000316139
035   $a(PQKBWorkID)10263455
035   $a(PQKB)11285680
035   $a(DE-He213)978-3-642-03564-7
035   $a(MiAaPQ)EBC3064466
035   $a(PPN)139950931
035   $a(EXLCZ)991000000000772850
100   $a20100301d2009      u|             0
101 0 $aeng
135   $aurnn|008mamaa
181   $ctxt
182   $cc
183   $acr
200 10$aAlgebraic Informatics$b[electronic resource] $e3rd International Conference on Algebraic Informatics, CAI 2009, Thessaloniki, Greece, Mai 19-22, 2009 /$fedited by Symeon Bozapalidis, George Rahonis
205   $a1st ed. 2009.
210  1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2009.
215   $a1 online resource (X, 361 p.) 
225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v5725
300   $aIncludes index.
311   $a3-642-03563-9 
327   $aInvited 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.
410  0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v5725
606   $aComputer science
606   $aComputer programming
606   $aMachine theory
606   $aComputer science?Mathematics
606   $aSoftware engineering
606   $aComputer Science Logic and Foundations of Programming
606   $aProgramming Techniques
606   $aTheory of Computation
606   $aFormal Languages and Automata Theory
606   $aSymbolic and Algebraic Manipulation
606   $aSoftware Engineering
615  0$aComputer science.
615  0$aComputer programming.
615  0$aMachine theory.
615  0$aComputer science?Mathematics.
615  0$aSoftware engineering.
615 14$aComputer Science Logic and Foundations of Programming.
615 24$aProgramming Techniques.
615 24$aTheory of Computation.
615 24$aFormal Languages and Automata Theory.
615 24$aSymbolic and Algebraic Manipulation.
615 24$aSoftware Engineering.
676   $a512
702   $aBozapalidis$b Symeon$4edt$4http://id.loc.gov/vocabulary/relators/edt
702   $aRahonis$b George$4edt$4http://id.loc.gov/vocabulary/relators/edt
712 12$aCAI 2009
906   $aBOOK
912   $a996465733003316
996   $aAlgebraic Informatics$92954948
997   $aUNISA