3. CAI 2009: Thessaloniki, Greece

Invited Paper of Werner Kuich

• Stephen L. Bloom, Zoltán Ésik, Werner Kuich:
  Cycle-Free Finite Automata in Partial Iterative Semirings. 1-12
  

Tutorials

• Alessandra Cherubini, Matteo Pradella:
  Picture Languages: From Wang Tiles to 2D Grammars. 13-46
  
• Wan Fokkink:
  Process Algebra: An Algebraic Theory of Concurrency. 47-77
  

Invited Papers

• Bruno Courcelle:
  On Several Proofs of the Recognizability Theorem. 78-80
  
• Dietrich Kuske:
  Theories of Automatic Structures and Their Complexity. 81-98
  
• Detlef Plump:
  The Graph Programming Language GP. 99-122
  
• Franz Winkler:
  Canonical Reduction Systems in Symbolic Mathematics. 123-135
  

Contributed Papers

• Paraskevas Alvanos, Dimitrios Poulakis:
  Solving Norm Form Equations over Number Fields. 136-146
  
• Marcella Anselmo, Maria Madonia:
  A Note on Unambiguity, Finite Ambiguity and Complementation in Recognizable Two-Dimensional Languages. 147-159
  
• Michel Bauderon, Rui Chen, Olivier Ly:
  Context-Free Categorical Grammars. 160-171
  
• Symeon Bozapalidis, Archontia Grammatikopoulou:
  An Eilenberg Theorem for Pictures. 172-188
  
• Symeon Bozapalidis, Antonios Kalampakas:
  On the Complexity of the Syntax of Tree Languages. 189-203
  
• Bo Cui, Lila Kari, Shinnosuke Seki:
  On the Reversibility of Parallel Insertion, and Its Relation to Comma Codes. 204-219
  
• Konstantinos A. Draziotis:
  Computation of Pell Numbers of the Form pX2. 220-226
  
• Zoltán Ésik, Tamás Hajgató:
  Iteration Grove Theories with Applications. 227-249
  
• Gabriele Fici:
  Combinatorics of Finite Words and Suffix Automata. 250-259
  
• Ondrej Klíma, Libor Polák:
  Polynomial Operators on Classes of Regular Languages. 260-277
  
• Christos Koukouvinos, Dimitris E. Simos:
  Self-dual Codes over Small Prime Fields from Combinatorial Designs. 278-287
  
• Andreas Maletti:
  A Backward and a Forward Simulation for Weighted Tree Automata. 288-304
  
• Andreas Maletti, Catalin Ionut Tîrnauca:
  Syntax-Directed Translations and Quasi-alphabetic Tree Bimorphisms - Revisited. 305-317
  
• Gerasimos C. Meletiou:
  Polynomial Interpolation of the k-th Root of the Discrete Logarithm. 318-323
  
• Friedrich Otto, Heiko Stamer:
  Single-Path Restarting Tree Automata. 324-341
  
• Dana Pardubská, Martin Plátek, Friedrich Otto:
  Parallel Communicating Grammar Systems with Regular Control. 342-360
  

Last update Sun May 19 21:46:42 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page