Symeon Bozapalidis / George Rahonis (eds.)

Algebraic Informatics

Second International Conference, CAI 2007, Thessalonkik, Greece, May 21-25, 2007, Revised Selected and Invited Papers
Herausgegeben:Bozapalidis, Symeon; Rahonis, George

• Broschiertes Buch

Produktbeschreibung

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.

---

Hinweis: Dieser Artikel kann nur an eine deutsche Lieferadresse ausgeliefert werden.

Produktdetails

• Theoretical Computer Science and General Issues 4728
• Verlag: Springer / Springer Berlin Heidelberg / Springer, Berlin
• Artikelnr. des Verlages: 12168668, 978-3-540-75413-8
• 2007
• Seitenzahl: 304
• Erscheinungstermin: 14. Dezember 2007
• Englisch
• Abmessung: 235mm x 155mm x 17mm
• Gewicht: 464g
• ISBN-13: 9783540754138
• ISBN-10: 354075413X
• Artikelnr.: 23111261

Inhaltsangabe

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.