Accepted Papers (in Random Order)


  • Levent Alpoge, Thomas Ang, Luke Schaeffer and Jeffrey Shallit. Decidability and Shortest Strings in Formal  Languages

  • Sherzod Turaev, Jürgen Dassow and Mohd Hasan Selamat. Language Classes Generated by Tree Controlled Grammars with Bounded Nonterminal Complexity

  • Jürgen Dassow, Florin Manea and Bianca Truthe. On Contextual Grammars with Subregular Selection Languages

  • Radu Gramatovici and Florin Manea. $k$-Local Internal Contextual Grammars

  • Yuan Gao and Sheng Yu. State complexity of four combined operations composed of union, intersection, star and reversal

  • Janusz Brzozowski, Baiyu Li and Yuli Ye. Syntactic Complexity of Prefix-, Suffix-, and Bifix-Free Languages

  • Andreas Malcher, Carlo Mereghetti and Beatrice Palano. Descriptional Complexity of Two-Way Pushdown Automata With Restricted Head Reversals

  • Fernando Arroyo, Juan Castellanos and Victor Mitrana. On the Degree of Team Cooperation in Grammar Systems

  • Erik D. Demaine, Sarah Eisenstat, Jeffrey Shallit and David A. Wilson. Remarks on Separating Words

  • Xiaoxue Piao and Kai Salomaa. State Trade-offs in Unranked Tree Automata

  • Jiri Wiedermann. Complexity of Nondeterministic Multitape Computations Based on Crossing Sequences

  • Krishna S and Gabriel Ciobanu. A \Sigma_2^p \cup \Pi_2^p lower bound using mobile membranes

  • Jean-Marc Champarnaud, Jean-Philippe Dubernard, Franck Guingne and Hadrien Jeanne. Geometrical Regular Languages and Linear Diophantine Systems

  • Kamal Lodaya, Madhavan Mukund and Ramchandra Phawade. Kleene theorems for product systems

  • Maris Valdats. Transition Function Complexity Of Finite Automata

  • Michal Kunc and Alexander Okhotin. State complexity of operations on two-way deterministic finite automata over a unary alphabet

  • Erzsébet Csuhaj-Varjú and György Vaszil. On the Size of Clustered Parallel Communicating Grammar Systems

  • Galina Jiraskova and Tomas Masopust. On the State Complexity of Projected  Languages

  • Galina Jiraskova and Juraj Sebej. Note on Reversal of Binary Regular Languages

  • Oscar Ibarra and Nicholas Tran. On Synchronized Multitape and Multihead Automata

  • Zuzana Bednarova, Viliam Geffert, Carlo Mereghetti and Beatrice Palano. The Size-Cost of Boolean Operations on Constant Height Deterministic Pushdown Automata