|
|
|
|
| LEADER |
00000nam a22000005i 4500 |
| 001 |
978-3-540-75414-5 |
| 003 |
DE-He213 |
| 005 |
20230405225757.0 |
| 007 |
cr nn 008mamaa |
| 008 |
100301s2007 gw | s |||| 0|eng d |
| 020 |
|
|
|a 9783540754145
|9 978-3-540-75414-5
|
| 024 |
7 |
|
|a 10.1007/978-3-540-75414-5
|2 doi
|
| 050 |
|
4 |
|a QA75.5-76.95
|
| 072 |
|
7 |
|a UYA
|2 bicssc
|
| 072 |
|
7 |
|a COM014000
|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 Second International Conference, CAI 2007, Thessalonkik, Greece, May 21-25, 2007, Revised Selected and Invited Papers /
|c edited by Symeon Bozapalidis, George Rahonis.
|
| 250 |
|
|
|a 1st ed. 2007.
|
| 264 |
|
1 |
|a Berlin, Heidelberg :
|b Springer Berlin Heidelberg :
|b Imprint: Springer,
|c 2007.
|
| 300 |
|
|
|a VIII, 289 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 4728
|
| 505 |
0 |
|
|a Invited 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 |
|a Computer science.
|
| 650 |
|
0 |
|a Algebra.
|
| 650 |
|
0 |
|a Machine theory.
|
| 650 |
|
0 |
|a Software engineering.
|
| 650 |
|
0 |
|a Computer science-Mathematics.
|
| 650 |
1 |
4 |
|a Theory of Computation.
|
| 650 |
2 |
4 |
|a Algebra.
|
| 650 |
2 |
4 |
|a Computer Science Logic and Foundations of Programming.
|
| 650 |
2 |
4 |
|a Formal Languages and Automata Theory.
|
| 650 |
2 |
4 |
|a Software Engineering.
|
| 650 |
2 |
4 |
|a Symbolic and Algebraic Manipulation.
|
| 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 9783540844594
|
| 776 |
0 |
8 |
|i Printed edition:
|z 9783540754138
|
| 830 |
|
0 |
|a Theoretical Computer Science and General Issues,
|x 2512-2029 ;
|v 4728
|
| 856 |
4 |
0 |
|u https://doi.uam.elogim.com/10.1007/978-3-540-75414-5
|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)
|
