
Algebraic Informatics
Second International Conference, CAI 2007, Thessalonkik, Greece, May 21-25, 2007, Revised Selected and Invited Papers
Herausgegeben: Bozapalidis, Symeon; Rahonis, George
PAYBACK Punkte
19 °P sammeln!
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.- Aperio...
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.