000 | 03334nam a22006015i 4500 | ||
---|---|---|---|
001 | 978-3-540-75414-5 | ||
003 | DE-He213 | ||
005 | 20240423125708.0 | ||
007 | cr nn 008mamaa | ||
008 | 100301s2007 gw | s |||| 0|eng d | ||
020 |
_a9783540754145 _9978-3-540-75414-5 |
||
024 | 7 |
_a10.1007/978-3-540-75414-5 _2doi |
|
050 | 4 | _aQA75.5-76.95 | |
072 | 7 |
_aUYA _2bicssc |
|
072 | 7 |
_aCOM014000 _2bisacsh |
|
072 | 7 |
_aUYA _2thema |
|
082 | 0 | 4 |
_a004.0151 _223 |
245 | 1 | 0 |
_aAlgebraic Informatics _h[electronic resource] : _bSecond International Conference, CAI 2007, Thessalonkik, Greece, May 21-25, 2007, Revised Selected and Invited Papers / _cedited by Symeon Bozapalidis, George Rahonis. |
250 | _a1st ed. 2007. | ||
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg : _bImprint: Springer, _c2007. |
|
300 |
_aVIII, 289 p. _bonline resource. |
||
336 |
_atext _btxt _2rdacontent |
||
337 |
_acomputer _bc _2rdamedia |
||
338 |
_aonline resource _bcr _2rdacarrier |
||
347 |
_atext file _bPDF _2rda |
||
490 | 1 |
_aTheoretical Computer Science and General Issues, _x2512-2029 ; _v4728 |
|
505 | 0 | _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. | |
650 | 0 | _aComputer science. | |
650 | 0 | _aAlgebra. | |
650 | 0 | _aMachine theory. | |
650 | 0 | _aSoftware engineering. | |
650 | 0 |
_aComputer science _xMathematics. |
|
650 | 1 | 4 | _aTheory of Computation. |
650 | 2 | 4 | _aAlgebra. |
650 | 2 | 4 | _aComputer Science Logic and Foundations of Programming. |
650 | 2 | 4 | _aFormal Languages and Automata Theory. |
650 | 2 | 4 | _aSoftware Engineering. |
650 | 2 | 4 | _aSymbolic and Algebraic Manipulation. |
700 | 1 |
_aBozapalidis, Symeon. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
700 | 1 |
_aRahonis, George. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer Nature eBook | |
776 | 0 | 8 |
_iPrinted edition: _z9783540754138 |
776 | 0 | 8 |
_iPrinted edition: _z9783540844594 |
830 | 0 |
_aTheoretical Computer Science and General Issues, _x2512-2029 ; _v4728 |
|
856 | 4 | 0 | _uhttps://doi.org/10.1007/978-3-540-75414-5 |
912 | _aZDB-2-SCS | ||
912 | _aZDB-2-SXCS | ||
912 | _aZDB-2-LNC | ||
942 | _cSPRINGER | ||
999 |
_c180737 _d180737 |