Verkauf durch Sack Fachmedien

Rahonis / Bozapalidis

Algebraic Informatics

Second International Conference, CAI 2007, Thessalonkik, Greece, May 21-25, 2007, Revised Selected and Invited Papers

Medium: Buch
ISBN: 978-3-540-75413-8
Verlag: Springer Berlin Heidelberg
Erscheinungstermin: 14.12.2007
Lieferfrist: bis zu 10 Tage

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.


Produkteigenschaften


  • Artikelnummer: 9783540754138
  • Medium: Buch
  • ISBN: 978-3-540-75413-8
  • Verlag: Springer Berlin Heidelberg
  • Erscheinungstermin: 14.12.2007
  • Sprache(n): Englisch
  • Auflage: 2007
  • Serie: Lecture Notes in Computer Science
  • Produktform: Kartoniert
  • Gewicht: 464 g
  • Seiten: 289
  • Format (B x H x T): 155 x 235 x 17 mm
  • Ausgabetyp: Kein, Unbekannt
Autoren/Hrsg.

Herausgeber

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.