Algebraic informatics : Second International Conference, CAI 2007, Thessalonkik, Greece, May 21-25, 2007, revised selected and invited papers

This book constitutes the refereed proceedings of the Second International Conference on Algebraic Informatics, CAI 2007, held in Thessaloniki, Greece, in May 2007. The papers cover topics such as algebraic semantics on graphs and trees, formal power series, syntactic objects, algebraic picture processing, infinite computation, acceptors and transducers for strings, trees, graphs, arrays, etc., and decision problems.

Jurgen Albert and German TischlerJean BerstelFrank DrewesManfred Droste and Guo-Qiang ZhangDora GiammarresiJozef GruskaOliver MatzUlrike Prange and Hartmut EhrigMarcella Anselmo and Maria MadoniaGiusi Castiglione and Roberto VaglicaFrank Drewes and Johanna HogbergZoltan Esik and Szabolcs IvanAntonios KalampakasAndreas MalettiSotiris Nikoletseas and Christoforos Raptopoulos and Paul G. SpirakisIakovos Ouranos and Petros StefaneasJean-Marcel PalloHeiko Stamer and Friedrich Otto

Invited Papers
On Generalizations of Weighted Finite Automata and Graphics Applications	p. 1
Sturmian and Episturmian Words: A Survey of Some Recent Results	p. 23
From Tree-Based Generators to Delegation Networks	p. 48
Bifinite Chu Spaces	p. 73
Tiling Recognizable Two-Dimensional Languages	p. 75
Algebraic Methods in Quantum Informatics	p. 87
Recognizable vs. Regular Picture Languages	p. 112
From Algebraic Graph Transformation to Adhesive HLR Categories and Systems	p. 122
Contributed Papers
Deterministic Two-Dimensional Languages over One-Letter Alphabet	p. 147
Recognizable Picture Languages and Polyominoes	p. 160
An Algebra for Tree-Based Music Generation	p. 172
Aperiodicity in Tree Automata	p. 189
The Syntactic Complexity of Eulerian Graphs	p. 208
Learning Deterministically Recognizable Tree Series-Revisited	p. 218
The Second Eigenvalue of Random Walks On Symmetric Random Intersection Graphs	p. 236
Verifying Security Protocols for Sensor Networks Using Algebraic Specification Techniques	p. 247
Nonassociativity a la Kleene	p. 260
Restarting Tree Automata and Linear Context-Free Tree Languages	p. 275
Author Index	p. 291

Available:*

On Order

Summary

Summary

Table of Contents