13. DCFS 2011: Gießen/Limburg, Germany

Invited Papers

• Jarkko Kari:
  Linear Algebra Based Bounds for One-Dimensional Cellular Automata. 1-7
  
• Friedrich Otto:
  On Restarting Automata with Window Size One. 8-33
  
• Stefan Schwoon, César Rodríguez:
  Construction and SAT-Based Verification of Contextual Unfoldings. 34-42
  
• Denis Thérien:
  The Power of Diversity. 43-54
  

Regular Papers

• Levent Alpoge, Thomas Ang, Luke Schaeffer, Jeffrey Shallit:
  Decidability and Shortest Strings in Formal Languages. 55-67
  
• Fernando Arroyo, Juan Castellanos, Victor Mitrana:
  On the Degree of Team Cooperation in CD Grammar Systems. 68-79
  
• Zuzana Bednárová, Viliam Geffert, Carlo Mereghetti, Beatrice Palano:
  The Size-Cost of Boolean Operations on Constant Height Deterministic Pushdown Automata. 80-92
  
• Janusz A. Brzozowski, Baiyu Li, Yuli Ye:
  Syntactic Complexity of Prefix-, Suffix-, and Bifix-Free Regular Languages. 93-106
  
• Jean-Marc Champarnaud, Jean-Philippe Dubernard, Franck Guingne, Hadrien Jeanne:
  Geometrical Regular Languages and Linear Diophantine Equations. 107-120
  
• Erzsébet Csuhaj-Varjú, György Vaszil:
  On the Number of Components and Clusters of Non-returning Parallel Communicating Grammar Systems. 121-134
  
• Jürgen Dassow, Florin Manea, Bianca Truthe:
  On Contextual Grammars with Subregular Selection Languages. 135-146
  
• Erik D. Demaine, Sarah Eisenstat, Jeffrey Shallit, David A. Wilson:
  Remarks on Separating Words. 147-157
  
• Yuan Gao, Sheng Yu:
  State Complexity of Four Combined Operations Composed of Union, Intersection, Star and Reversal. 158-171
  
• Radu Gramatovici, Florin Manea:
  k-Local Internal Contextual Grammars. 172-183
  
• Oscar H. Ibarra, Nicholas Q. Trân:
  On Synchronized Multitape and Multihead Automata. 184-197
  
• Galina Jirásková, Tomás Masopust:
  State Complexity of Projected Languages. 198-211
  
• Galina Jirásková, Juraj Sebej:
  Note on Reversal of Binary Regular Languages. 212-221
  
• Michal Kunc, Alexander Okhotin:
  State Complexity of Operations on Two-Way Deterministic Finite Automata over a Unary Alphabet. 222-234
  
• Kamal Lodaya, Madhavan Mukund, Ramchandra Phawade:
  Kleene Theorems for Product Systems. 235-247
  
• Andreas Malcher, Carlo Mereghetti, Beatrice Palano:
  Descriptional Complexity of Two-Way Pushdown Automata with Restricted Head Reversals. 248-260
  
• Xiaoxue Piao, Kai Salomaa:
  State Trade-Offs in Unranked Tree Automata. 261-274
  
• Shankara Narayanan Krishna, Gabriel Ciobanu:
  A S₂^P ÈP₂^P\Sigma_2^P \cup \Pi_2^P Lower Bound Using Mobile Membranes. 275-288
  
• Sherzod Turaev, Jürgen Dassow, Mohd Hasan Selamat:
  Language Classes Generated by Tree Controlled Grammars with Bounded Nonterminal Complexity. 289-300
  
• Maris Valdats:
  Transition Function Complexity of Finite Automata. 301-313
  
• Jirí Wiedermann:
  Complexity of Nondeterministic Multitape Computations Based on Crossing Sequences. 314-327
  

Last update Wed May 22 23:17:23 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page