
Algebraic Informatics
Second International Conference, CAI 2007, Thessalonkik, Greece, May 21-25, 2007, Revised Selected and Invited Papers
Springer (Publisher)
Published on 14. December 2007
Book
Paperback/Softback
VIII, 289 pages
978-3-540-75413-8 (ISBN)
Description
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.
More details
Series
Edition
2007 ed.
Language
English
Place of publication
Berlin
Germany
Publishing group
Springer Berlin
Target group
Professional and scholarly
Research
Illustrations
VIII, 289 p.
Dimensions
Height: 235 mm
Width: 155 mm
Thickness: 17 mm
Weight
464 gr
ISBN-13
978-3-540-75413-8 (9783540754138)
DOI
10.1007/978-3-540-75414-5
Schweitzer Classification
Content
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.