Buch, Englisch, 289 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 464 g
Second International Conference, CAI 2007, Thessalonkik, Greece, May 21-25, 2007, Revised Selected and Invited Papers
Buch, Englisch, 289 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 464 g
Reihe: Theoretical Computer Science and General Issues
ISBN: 978-3-540-75413-8
Verlag: Springer Berlin Heidelberg
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.
Zielgruppe
Research
Autoren/Hrsg.
Fachgebiete
- Mathematik | Informatik EDV | Informatik Informatik Logik, formale Sprachen, Automaten
- Mathematik | Informatik EDV | Informatik Informatik Mathematik für Informatiker
- Mathematik | Informatik Mathematik Algebra Homologische Algebra
- Mathematik | Informatik EDV | Informatik Programmierung | Softwareentwicklung Programmierung: Methoden und Allgemeines
- Mathematik | Informatik EDV | Informatik Programmierung | Softwareentwicklung Software Engineering Objektorientierte Softwareentwicklung
Weitere Infos & Material
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.
