|
|
|
|
| LEADER |
00000nam a22000005i 4500 |
| 001 |
978-3-642-03564-7 |
| 003 |
DE-He213 |
| 005 |
20230406031045.0 |
| 007 |
cr nn 008mamaa |
| 008 |
100301s2009 gw | s |||| 0|eng d |
| 020 |
|
|
|a 9783642035647
|9 978-3-642-03564-7
|
| 024 |
7 |
|
|a 10.1007/978-3-642-03564-7
|2 doi
|
| 050 |
|
4 |
|a QA75.5-76.95
|
| 072 |
|
7 |
|a UYA
|2 bicssc
|
| 072 |
|
7 |
|a COM051000
|2 bisacsh
|
| 072 |
|
7 |
|a UYA
|2 thema
|
| 082 |
0 |
4 |
|a 004.0151
|2 23
|
| 245 |
1 |
0 |
|a Algebraic Informatics
|h [electronic resource] :
|b 3rd International Conference on Algebraic Informatics, CAI 2009, Thessaloniki, Greece, Mai 19-22, 2009 /
|c edited by Symeon Bozapalidis, George Rahonis.
|
| 250 |
|
|
|a 1st ed. 2009.
|
| 264 |
|
1 |
|a Berlin, Heidelberg :
|b Springer Berlin Heidelberg :
|b Imprint: Springer,
|c 2009.
|
| 300 |
|
|
|a X, 361 p.
|b online resource.
|
| 336 |
|
|
|a text
|b txt
|2 rdacontent
|
| 337 |
|
|
|a computer
|b c
|2 rdamedia
|
| 338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
| 347 |
|
|
|a text file
|b PDF
|2 rda
|
| 490 |
1 |
|
|a Theoretical Computer Science and General Issues,
|x 2512-2029 ;
|v 5725
|
| 505 |
0 |
|
|a 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.
|
| 650 |
|
0 |
|a Computer science.
|
| 650 |
|
0 |
|a Computer programming.
|
| 650 |
|
0 |
|a Machine theory.
|
| 650 |
|
0 |
|a Computer science-Mathematics.
|
| 650 |
|
0 |
|a Software engineering.
|
| 650 |
1 |
4 |
|a Computer Science Logic and Foundations of Programming.
|
| 650 |
2 |
4 |
|a Programming Techniques.
|
| 650 |
2 |
4 |
|a Theory of Computation.
|
| 650 |
2 |
4 |
|a Formal Languages and Automata Theory.
|
| 650 |
2 |
4 |
|a Symbolic and Algebraic Manipulation.
|
| 650 |
2 |
4 |
|a Software Engineering.
|
| 700 |
1 |
|
|a Bozapalidis, Symeon.
|e editor.
|4 edt
|4 http://id.loc.gov/vocabulary/relators/edt
|
| 700 |
1 |
|
|a Rahonis, George.
|e editor.
|4 edt
|4 http://id.loc.gov/vocabulary/relators/edt
|
| 710 |
2 |
|
|a SpringerLink (Online service)
|
| 773 |
0 |
|
|t Springer Nature eBook
|
| 776 |
0 |
8 |
|i Printed edition:
|z 9783642035654
|
| 776 |
0 |
8 |
|i Printed edition:
|z 9783642035630
|
| 830 |
|
0 |
|a Theoretical Computer Science and General Issues,
|x 2512-2029 ;
|v 5725
|
| 856 |
4 |
0 |
|u https://doi.uam.elogim.com/10.1007/978-3-642-03564-7
|z Texto Completo
|
| 912 |
|
|
|a ZDB-2-SCS
|
| 912 |
|
|
|a ZDB-2-SXCS
|
| 912 |
|
|
|a ZDB-2-LNC
|
| 950 |
|
|
|a Computer Science (SpringerNature-11645)
|
| 950 |
|
|
|a Computer Science (R0) (SpringerNature-43710)
|
