![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
2. CAI 2007: Thessaloniki, Greece
- Symeon Bozapalidis, George Rahonis:
Algebraic Informatics, Second International Conference, CAI 2007, Thessaloniki, Greece, May 21-25, 2007, Revised Selected and Invited Papers. Lecture Notes in Computer Science 4728, Springer 2007, ISBN 978-3-540-75413-8
Invited Papers
- Jürgen Albert, German Tischler:
On Generalizations of Weighted Finite Automata and Graphics Applications. 1-22 - Jean Berstel:
Sturmian and Episturmian Words. 23-47 - Frank Drewes:
From Tree-Based Generators to Delegation Networks. 48-72 - Manfred Droste, Guo-Qiang Zhang:
Bifinite Chu Spaces. 73-74 - Dora Giammarresi:
Tiling Recognizable Two-Dimensional Languages. 75-86 - Jozef Gruska:
Algebraic Methods in Quantum Informatics. 87-111 - Oliver Matz:
Recognizable vs. Regular Picture Languages. 112-121 - Ulrike Prange
, Hartmut Ehrig:
From Algebraic Graph Transformation to Adhesive HLR Categories and Systems. 122-146
Contributed Papers
- Marcella Anselmo, Maria Madonia:
Deterministic Two-Dimensional Languages over One-Letter Alphabet. 147-159 - Giusi Castiglione, Roberto Vaglica:
Recognizable Picture Languages and Polyominoes. 160-171 - Frank Drewes, Johanna Högberg:
An Algebra for Tree-Based Music Generation. 172-188 - Zoltán Ésik, Szabolcs Iván
:
Aperiodicity in Tree Automata. 189-207 - Antonios Kalampakas
:
The Syntactic Complexity of Eulerian Graphs. 208-217 - Andreas Maletti:
Learning Deterministically Recognizable Tree Series - Revisited. 218-235 - Sotiris E. Nikoletseas, Christoforos L. Raptopoulos, Paul G. Spirakis:
The Second Eigenvalue of Random Walks On Symmetric Random Intersection Graphs. 236-246 - Iakovos Ouranos, Petros S. Stefaneas:
Verifying Security Protocols for Sensor Networks Using Algebraic Specification Techniques. 247-259 - Jean Marcel Pallo:
Nonassociativity à la Kleene. 260-274 - Heiko Stamer, Friedrich Otto:
Restarting Tree Automata and Linear Context-Free Tree Languages. 275-289
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.