| 2011 | A Cascade Decomposition of Weighted Finite Transition Systems. Manfred Droste, Ingmar Meinecke, Branimir Seselja, Andreja Tepavcevic |
| 2011 | A Functional Program for Regular Expressions Matching - Abstract of Invited Talk. Thomas Wilke |
| 2011 | A Sufficient Condition for Erasing Productions to Be Avoidable. Georg Zetzsche |
| 2011 | Abelian Primitive Words. Michael Domaratzki, Narad Rampersad |
| 2011 | Avoiding Abelian Powers in Partial Words. Francine Blanchet-Sadri, Sean Simmons |
| 2011 | Boolean Algebras of Regular Languages. Victor L. Selivanov, Anton Konovalov |
| 2011 | Characterizing the Regular Languages by Nonforgetting Restarting Automata. Norbert Hundeshagen, Friedrich Otto |
| 2011 | Chop Operations and Expressions: Descriptional Complexity Considerations. Markus Holzer, Sebastian Jakobi |
| 2011 | Computational Aspects of Asynchronous Cellular Automata. Jérôme Chandesris, Alberto Dennunzio, Enrico Formenti, Luca Manzoni |
| 2011 | Counting the Orderings for Multisets in Consecutive Ones Property and PQ-Trees. Giovanni Battaglia, Roberto Grossi, Noemi Scutellà |
| 2011 | Deciding Networks of Evolutionary Processors. Florin Manea |
| 2011 | Describing Periodicity in Two-Way Deterministic Finite Automata Using Transformation Semigroups. Michal Kunc, Alexander Okhotin |
| 2011 | Developments in Language Theory - 15th International Conference, DLT 2011, Milan, Italy, July 19-22, 2011. Proceedings Giancarlo Mauri, Alberto Leporati |
| 2011 | Encoding Centered Polyominoes by Means of a Regular Language. Daniela Battaglino, Jean-Marc Fedou, Andrea Frosini, Simone Rinaldi |
| 2011 | Enumeration and Decidable Properties of Automatic Sequences. Emilie Charlier, Narad Rampersad, Jeffrey O. Shallit |
| 2011 | Fife's Theorem Revisited. Jeffrey O. Shallit |
| 2011 | From Linear Partitions to Parallelogram Polyominoes. Roberto Mantaci, Paolo Massazza |
| 2011 | Generalized One-Unambiguity. Pascal Caron, Yo-Sub Han, Ludovic Mignot |
| 2011 | Growth Properties of Power-Free Languages. Arseny M. Shur |
| 2011 | Hunting Redundancies in Strings. Golnaz Badkobeh, Supaporn Chairungsee, Maxime Crochemore |
| 2011 | Inference of Residual Finite-State Tree Automata from Membership Queries and Finite Positive Data. Anna Kasprzik |
| 2011 | Infinite Words Rich and Almost Rich in Generalized Palindromes. Edita Pelantová, Stepán Starosta |
| 2011 | Languages vs. Namit Chaturvedi, Jörg Olschewski, Wolfgang Thomas |
| 2011 | Models of Pushdown Automata with Reset. Nuri Tasdemir, A. C. Cem Say |
| 2011 | Morphic Characterizations in Terms of Insertion Systems with a Context of Length One. Kaoru Fujioka |
| 2011 | Never Minimal Automata and the Rainbow Bipartite Subgraph Problem. Emanuele Rodaro, Pedro V. Silva |
| 2011 | Nodes Connected by Path Languages. Markus Holzer, Martin Kutrib, Ursula Leiter |
| 2011 | On Brzozowski's Conjecture for the Free Burnside Semigroup Satisfying Andrey N. Plyushchenko, Arseny M. Shur |
| 2011 | On Highly Repetitive and Power Free Words. Narad Rampersad, Elise Vaslet |
| 2011 | On Non-complete Sets and Restivo's Conjecture. Vladimir V. Gusev, Elena V. Pribavkina |
| 2011 | On Prefix Normal Words. Gabriele Fici, Zsuzsanna Lipták |
| 2011 | On Two-Way Transducers. Oscar H. Ibarra, Hsu-Chun Yen |
| 2011 | On the Representability of Line Graphs. Sergey Kitaev, Pavel Salimov, Christopher Severs, Henning Úlfarsson |
| 2011 | Regular Splicing Languages Must Have a Constant. Paola Bonizzoni, Natasha Jonoska |
| 2011 | Scattered Context-Free Linear Orderings. Zoltán Ésik |
| 2011 | Self-organization in Cellular Automata: A Particle-Based Approach. Benjamin Hellouin de Menibus, Mathieu Sablik |
| 2011 | Short 3-Collapsing Words over a 2-Letter Alphabet. Alessandra Cherubini, Achille Frigeri, Brunetto Piochi |
| 2011 | Simulations over Two-Dimensional On-Line Tessellation Automata. Gérard Cécé, Alain Giorgetti |
| 2011 | Solving Word Problems in Group Extensions over Infinite Words. Volker Diekert, Alexei G. Myasnikov |
| 2011 | Some Remarks on Automata Minimality. Antonio Restivo, Roberto Vaglica |
| 2011 | State Complexity Research and Approximation. Sheng Yu, Yuan Gao |
| 2011 | Syntactic Complexity of Ideal and Closed Languages. Janusz A. Brzozowski, Yuli Ye |
| 2011 | The Average Transition Complexity of Glushkov and Partial Derivative Automata. Sabine Broda, António Machiavelo, Nelma Moreira, Rogério Reis |
| 2011 | Theory of Átomata. Janusz A. Brzozowski, Hellis Tamm |
| 2011 | There Does Not Exist a Minimal Full Trio with Respect to Bounded Context-Free Languages. Juha Kortelainen, Tuukka Salmi |
| 2011 | Towards Dual Approaches for Learning Context-Free Grammars Based on Syntactic Concept Lattices. Ryo Yoshinaka |
| 2011 | Δ-Clearing Restarting Automata and CFL \makebox{\sf CFL}. Peter Cerno, Frantisek Mráz |