000 | 03728nam a22006015i 4500 | ||
---|---|---|---|
001 | 978-3-642-03564-7 | ||
003 | DE-He213 | ||
005 | 20240423125750.0 | ||
007 | cr nn 008mamaa | ||
008 | 100301s2009 gw | s |||| 0|eng d | ||
020 |
_a9783642035647 _9978-3-642-03564-7 |
||
024 | 7 |
_a10.1007/978-3-642-03564-7 _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] : _b3rd International Conference on Algebraic Informatics, CAI 2009, Thessaloniki, Greece, Mai 19-22, 2009 / _cedited by Symeon Bozapalidis, George Rahonis. |
250 | _a1st ed. 2009. | ||
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg : _bImprint: Springer, _c2009. |
|
300 |
_aX, 361 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 ; _v5725 |
|
505 | 0 | _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. | |
650 | 0 | _aComputer science. | |
650 | 0 | _aComputer programming. | |
650 | 0 | _aMachine theory. | |
650 | 0 |
_aComputer science _xMathematics. |
|
650 | 0 | _aSoftware engineering. | |
650 | 1 | 4 | _aComputer Science Logic and Foundations of Programming. |
650 | 2 | 4 | _aProgramming Techniques. |
650 | 2 | 4 | _aTheory of Computation. |
650 | 2 | 4 | _aFormal Languages and Automata Theory. |
650 | 2 | 4 | _aSymbolic and Algebraic Manipulation. |
650 | 2 | 4 | _aSoftware Engineering. |
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: _z9783642035630 |
776 | 0 | 8 |
_iPrinted edition: _z9783642035654 |
830 | 0 |
_aTheoretical Computer Science and General Issues, _x2512-2029 ; _v5725 |
|
856 | 4 | 0 | _uhttps://doi.org/10.1007/978-3-642-03564-7 |
912 | _aZDB-2-SCS | ||
912 | _aZDB-2-SXCS | ||
912 | _aZDB-2-LNC | ||
942 | _cSPRINGER | ||
999 |
_c181474 _d181474 |