| 2012 | On Context-Free Languages of Scattered Words. | Zoltn sik, Satoshi Okawa |
| 2012 | Acceptance Conditions for ω-Languages. | Alberto Dennunzio, Enrico Formenti, Julien Provillard |
| 2012 | P and dP Automata: Unconventional versus Classical Automata. | Erzsbet Csuhaj-Varj |
| 2012 | Checking Determinism of Regular Expressions with Counting. | Haiming Chen, Ping Lu |
| 2012 | Two-Way Transducers with a Two-Way Output Tape. | Olivier Carton |
| 2012 | Visibly Pushdown Automata with Multiplicities: Finiteness and K-Boundedness. | Mathieu Caralp, Pierre-Alain Reynier, Jean-Marc Talbot |
| 2012 | Unambiguous Constrained Automata. | Michal Cadilhac, Alain Finkel, Pierre McKenzie |
| 2012 | Unidirectional Derivation Semantics for Synchronous Tree-Adjoining Grammars. | Matthias Bchse, Andreas Maletti, Heiko Vogler |
| 2012 | Quotient Complexities of Atoms of Regular Languages. | Janusz A. Brzozowski, Hellis Tamm |
| 2012 | Learning Rational Functions. | Adrien Boiret, Aurlien Lemay, Joachim Niehren |
| 2012 | Squares in Binary Partial Words. | Francine Blanchet-Sadri, Yang Jiao, John M. Machacek |
| 2012 | Decidability of Geometricity of Regular Languages. | Marie-Pierre Bal, Jean-Marc Champarnaud, Jean-Philippe Dubernard, Hadrien Jeanne, Sylvain Lombardy |
| 2012 | Semigroups with a Context-Free Word Problem. | Michael Hoffmann, Derek F. Holt, Matthew D. Owens, Richard M. Thomas |
| 2011 | A Sufficient Condition for Erasing Productions to Be Avoidable. | Georg Zetzsche |
| 2011 | State Complexity Research and Approximation. | Sheng Yu, Yuan Gao |
| 2011 | Towards Dual Approaches for Learning Context-Free Grammars Based on Syntactic Concept Lattices. | Ryo Yoshinaka |
| 2011 | A Functional Program for Regular Expressions Matching - Abstract of Invited Talk. | Thomas Wilke |
| 2011 | Models of Pushdown Automata with Reset. | Nuri Tasdemir, A. C. Cem Say |
| 2011 | Growth Properties of Power-Free Languages. | Arseny M. Shur |
| 2011 | Fife's Theorem Revisited. | Jeffrey O. Shallit |
| 2011 | Boolean Algebras of Regular Languages. | Victor L. Selivanov, Anton Konovalov |
| 2011 | Never Minimal Automata and the Rainbow Bipartite Subgraph Problem. | Emanuele Rodaro, Pedro V. Silva |
| 2011 | Some Remarks on Automata Minimality. | Antonio Restivo, Roberto Vaglica |
| 2011 | On Highly Repetitive and Power Free Words. | Narad Rampersad, Elise Vaslet |
| 2011 | On Brzozowski's Conjecture for the Free Burnside Semigroup Satisfying | Andrey N. Plyushchenko, Arseny M. Shur |