LEADER 03687nam  22007335  450 
001 996465436803316
005 20230405225757.0
010   $a3-540-75414-8
024 7 $a10.1007/978-3-540-75414-5
035   $a(CKB)1000000000490293
035   $a(SSID)ssj0000316138
035   $a(PQKBManifestationID)11261603
035   $a(PQKBTitleCode)TC0000316138
035   $a(PQKBWorkID)10263181
035   $a(PQKB)11085439
035   $a(DE-He213)978-3-540-75414-5
035   $a(MiAaPQ)EBC3068122
035   $a(PPN)123731607
035   $a(EXLCZ)991000000000490293
100   $a20100301d2007      u|             0
101 0 $aeng
135   $aurnn|008mamaa
181   $ctxt
182   $cc
183   $acr
200 10$aAlgebraic Informatics$b[electronic resource] $eSecond International Conference, CAI 2007, Thessalonkik, Greece, May 21-25, 2007, Revised Selected and Invited Papers /$fedited by Symeon Bozapalidis, George Rahonis
205   $a1st ed. 2007.
210  1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2007.
215   $a1 online resource (VIII, 289 p.) 
225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v4728
300   $aBibliographic Level Mode of Issuance: Monograph
311   $a3-540-75413-X 
320   $aIncludes bibliographical references and index.
327   $aInvited 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.
410  0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v4728
606   $aComputer science
606   $aAlgebra
606   $aMachine theory
606   $aSoftware engineering
606   $aComputer science?Mathematics
606   $aTheory of Computation
606   $aAlgebra
606   $aComputer Science Logic and Foundations of Programming
606   $aFormal Languages and Automata Theory
606   $aSoftware Engineering
606   $aSymbolic and Algebraic Manipulation
615  0$aComputer science.
615  0$aAlgebra.
615  0$aMachine theory.
615  0$aSoftware engineering.
615  0$aComputer science?Mathematics.
615 14$aTheory of Computation.
615 24$aAlgebra.
615 24$aComputer Science Logic and Foundations of Programming.
615 24$aFormal Languages and Automata Theory.
615 24$aSoftware Engineering.
615 24$aSymbolic and Algebraic Manipulation.
676   $a004.0151
702   $aBozapalidis$b Symeon$4edt$4http://id.loc.gov/vocabulary/relators/edt
702   $aRahonis$b George$4edt$4http://id.loc.gov/vocabulary/relators/edt
906   $aBOOK
912   $a996465436803316
996   $aAlgebraic Informatics$92954948
997   $aUNISA