8. DLT 2004: Auckland, New Zealand

Invited Papers

• Bruno Courcelle:
  Recognizable Sets of Graphs, Hypergraphs and Relational Structures: A Survey. 1-11
  
• Rodney G. Downey, Catherine McCartin:
  Some New Directions and Questions in Parameterized Complexity. 12-26
  
• Andrzej Ehrenfeucht, Grzegorz Rozenberg:
  Basic Notions of Reaction Systems. 27-29
  
• Blaise Genest, Anca Muscholl, Dietrich Kuske:
  A Kleene Theorem for a Class of Communicating Automata with Effective Algorithms. 30-48
  
• Natasa Jonoska, Masahico Saito:
  Algebraic and Topological Models for DNA Recombinant Processes. 49-62
  

Contributed Papers

• Marcella Anselmo, Dora Giammarresi, Maria Madonia:
  Regular Expressions for Two-Dimensional Languages Over One-Letter Alphabet. 63-75
  
• Maurice H. ter Beek, Erzsébet Csuhaj-Varjú, Markus Holzer, György Vaszil:
  On Competence in CD Grammar Systems. 76-88
  
• Bernd Borchert, Klaus-Jörn Lange, Frank Stephan, Pascal Tesson, Denis Thérien:
  The Dot-Depth and the Polynomial Hierarchy Correspond on the Delta Levels. 89-101
  
• Henning Bordihn, Markus Holzer, Martin Kutrib:
  Input Reversals and Iterated Pushdown Automata: A New Characterization of Khabbaz Geometric Hierarchy of Languages. 102-113
  
• Christian Choffrut, Massimiliano Goldwurm, Violetta Lonati:
  On the Maximum Coefficients of Rational Formal Series in Commuting Variables. 114-126
  
• Mark Daley, Michael Domaratzki:
  On Codes Defined by Bio-Operations. 127-138
  
• Flavio D'Alessandro, Stefano Varricchio:
  Avoidable Sets and Well Quasi-Orders. 139-150
  
• Jürgen Dassow:
  A Ciliate Bio-operation and Language Families. 151-162
  
• Michael Domaratzki:
  Semantic Shuffle on and Deletion Along Trajectories. 163-174
  
• Chiara Epifanio, Filippo Mignosi, Jeffrey Shallit, Ilaria Venturini:
  Sturmian Graphs and a Conjecture of Moser. 175-187
  
• Rudolf Freund:
  P Systems Working in the Sequential Mode on Arrays and Strings. 188-199
  
• Jozef Gruska, Salvatore La Torre, Mimmo Parente:
  Optimal Time and Communication Solutions of Firing Squad Synchronization Problems on Square Arrays, Toruses and Rings. 200-211
  
• Oscar H. Ibarra, Hsu-Chun Yen, Zhe Dang:
  The Power of Maximal Parallelism in P Systems. 212-224
  
• Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda:
  An Efficient Pattern Matching Algorithm on a Subclass of Context Free Grammars. 225-236
  
• Tomasz Jurdzinski, Friedrich Otto, Frantisek Mráz, Martin Plátek:
  On the Complexity of 2-Monotone Restarting Automata. 237-248
  
• Tomasz Jurdzinski, Friedrich Otto, Frantisek Mráz, Martin Plátek:
  On Left-Monotone Deterministic Restarting Automata. 249-260
  
• Oleksiy Kurganskyy, Igor Potapov:
  On the Computation Power of Finite Automata in Two-dimensional Environments. 261-271
  
• Dietrich Kuske, Peter Weigel:
  The Role of the Complementarity Relation in Watson-Crick Automata and Sticker Systems. 272-283
  
• Martin Kutrib, Andreas Malcher, Detlef Wotschke:
  The Boolean Closure of Linear Context-Free Languages. 284-295
  
• Stephen R. Lakin, Richard M. Thomas:
  Context-Sensitive Decision Problems in Groups. 296-307
  
• Markus Lohrey:
  Decidability and Complexity in Automatic Monoids. 308-320
  
• Andreas Maletti:
  Relating Tree Series Transducers and Weighted Tree Automata. 321-333
  
• Anca Muscholl, Igor Walukiewicz:
  An NP-Complete Fragment of LTL. 334-344
  
• Igor Potapov:
  From Post Systems to the Reachability Problems for Matrix Semigroups and Multicounter Automata. 345-356
  
• Narad Rampersad:
  Words Avoiding 7/3-Powers and the Thue-Morse Morphism. 357-367
  
• Daniel Reidenbach:
  On the Equivalence Problem for E-pattern Languages over Small Alphabets. 368-380
  
• Chloe Rispal, Olivier Carton:
  Complementation of Rational Sets on Countable Scattered Linear Orderings. 381-392
  
• Ludwig Staiger:
  On the Hausdorff Measure of omega-Power Languages. 393-405
  
• Bianca Truthe:
  A Method for Deciding the Finiteness of Deterministic Tabled Picture Languages. 406-417
  
• Sergey Verlan:
  Tissue P Systems with Minimal Symport/Antiport. 418-430