13. DLT 2009: Stuttgart, Germany

Invited Talks

• Mikolaj Bojanczyk:
  Factorization Forests. 1-17
  
• Benedikt Bollig, Paul Gastin:
  Weighted versus Probabilistic Logics. 18-38
  
• Tero Harju:
  Post Correspondence Problem and Small Dimensional Matrices. 39-46
  
• Christos A. Kapoutsis:
  Size Complexity of Two-Way Finite Automata. 47-66
  
• Jorge Almeida, Benjamin Steinberg:
  Matrix Mortality and the Cerný-Pin Conjecture. 67-80
  

Regular Papers

• Marie-Pierre Béal, Dominique Perrin:
  A Quadratic Upper Bound on the Size of a Synchronizing Word in One-Cluster Automata. 81-90
  
• Christoph Behle, Andreas Krebs, Stephanie Reifferscheid:
  Regular Languages Definable by Majority Quantifiers with Two Variables. 91-102
  
• Alberto Bertoni, Christian Choffrut, Roberto Radicioni:
  The Inclusion Problem of Context-Free Languages: Some Tractable Cases. 103-112
  
• Brandon Blakeley, Francine Blanchet-Sadri, Josh Gunter, Narad Rampersad:
  On the Complexity of Deciding Avoidability of Sets of Partial Words. 113-124
  
• Janusz A. Brzozowski, Elyot Grant, Jeffrey Shallit:
  Closures in Formal Languages and Kuratowski's Theorem. 125-144
  
• Michelangelo Bucci, Aldo de Luca, Alessandro De Luca:
  Rich and Periodic-Like Words. 145-155
  
• Simone Campanoni, Stefano Crespi-Reghizzi:
  Traces of Control-Flow Graphs. 156-169
  
• Olivier Carton:
  Left and Right Synchronous Relations. 170-182
  
• Elena Czeizler, Eugen Czeizler, Lila Kari, Shinnosuke Seki:
  An Extension of the Lyndon Schützenberger Result to Pseudoperiodic Words. 183-194
  
• Bruno Durand, Victor Poupet:
  Asymptotic Cellular Complexity. 195-206
  
• Ömer Egecioglu:
  Strongly Regular Grammars and Regular Approximation of Context-Free Languages. 207-220
  
• Szilárd Zsolt Fazekas:
  Powers of Regular Languages. 221-227
  
• Dominik D. Freydenberger, Daniel Reidenbach:
  Existence and Nonexistence of Descriptive Patterns. 228-239
  
• Pierluigi Frisco, Oscar H. Ibarra:
  On Stateless Multihead Finite Automata and Multihead Pushdown Automata. 240-251
  
• Christiane Frougny, Anna Chiara Lai:
  On Negative Bases. 252-263
  
• Amy Glen, Bjarni V. Halldórsson, Sergey Kitaev:
  Crucial Words for Abelian Powers. 264-275
  
• Hermann Gruber, Markus Holzer:
  Tight Bounds on the Descriptional Complexity of Regular Expressions. 276-287
  
• Emmanuel Jeandel, Guillaume Theyssier:
  Subshifts, Languages and Logic. 288-299
  
• Galina Jirásková:
  Magic Numbers and Ternary Alphabet. 300-311
  
• Makoto Kanazawa:
  The Pumping Lemma for Well-Nested Multiple Context-Free Languages. 312-325
  
• Daniel Kirsten:
  The Support of a Recognizable Series over a Zero-Sum Free, Commutative Semiring Is Recognizable. 326-333
  
• Vassilis Kountouriotis, Christos Nomikos, Panos Rondogiannis:
  A Game-Theoretic Characterization of Boolean Grammars. 334-347
  
• Markku Laine, Wojciech Plandowski:
  Word Equations with One Unknown. 348-359
  
• Tommi Lehtinen, Alexander Okhotin:
  On Equations over Sets of Numbers and Their Limitations. 360-371
  
• Florin Manea, Victor Mitrana, José M. Sempere:
  Some Remarks on Superposition Based on Watson-Crick-Like Complementarity. 372-383
  
• Ingmar Meinecke:
  A Weighted µ-Calculus on Words. 384-395
  
• Fabio Mogavero, Aniello Murano:
  Branching-Time Temporal Logics with Minimal Model Quantifiers. 396-409
  
• Holger Petersen:
  Simulations by Time-Bounded Counter Machines. 410-418
  
• Karin Quaas:
  Weighted Timed MSO Logics. 419-430
  
• Antonio Restivo, Giovanna Rosone:
  Balanced Words Having Simple Burrows-Wheeler Transform. 431-442
  
• Aleksi Saarela:
  On the Complexity of Hmelevskii's Theorem and Satisfiability of Three Unknown Equations. 443-453
  
• Oleg V. Kudinov, Victor L. Selivanov:
  Definability in the Infix Order on Words. 454-465
  
• Arseny M. Shur:
  Two-Sided Bounds for the Growth Rates of Power-Free Languages. 466-477
  
• Rodrigo de Souza:
  On the Decidability of the Equivalence for a Certain Class of Transducers. 478-489
  
• Georg Zetzsche:
  Erasing in Petri Net Languages and Matrix Grammars. 490-501