| 2015 | *-Continuous Kleene ω-Algebras. Zoltán Ésik, Uli Fahrenberg, Axel Legay |
| 2015 | A Connected 3-State Reversible Mealy Automaton Cannot Generate an Infinite Burnside Group. Ines Klimann, Matthieu Picantin, Dmytro Savchuk |
| 2015 | Complexity Analysis: Transformation Monoids of Finite Automata. Christian Brandl, Hans Ulrich Simon |
| 2015 | Complexity Bounds of Constant-Space Quantum Computation - (Extended Abstract). Tomoyuki Yamakami |
| 2015 | Consensus Game Acceptors. Dietmar Berwanger, Marie van den Bogaard |
| 2015 | Deciding Proper Conjugacy of Classes of One-Sided Finite-Type-Dyck Shifts. Marie-Pierre Béal, Pavel Heller |
| 2015 | Deterministic Ordered Restarting Automata that Compute Functions. Friedrich Otto, Kent Kwee |
| 2015 | Developments in Language Theory - 19th International Conference, DLT 2015, Liverpool, UK, July 27-30, 2015, Proceedings. Igor Potapov |
| 2015 | Diverse Palindromic Factorization Is NP-complete. Hideo Bannai, Travis Gagie, Shunsuke Inenaga, Juha Kärkkäinen, Dominik Kempa, Marcin Piatkowski, Simon J. Puglisi, Shiho Sugimoto |
| 2015 | Enumeration Formulæ in Neutral Sets. Francesco Dolce, Dominique Perrin |
| 2015 | Ergodic Infinite Permutations of Minimal Complexity. Sergey V. Avgustinovich, Anna E. Frid, Svetlana Puzynina |
| 2015 | Factorization in Formal Languages. Paul C. Bell, Daniel Reidenbach, Jeffrey O. Shallit |
| 2015 | Finite Automata Over Infinite Alphabets: Two Models with Transitions for Local Change. Christopher Czyba, Christopher Spinrath, Wolfgang Thomas |
| 2015 | Garside and Quadratic Normalisation: A Survey. Patrick Dehornoy |
| 2015 | Generalizations of Code Languages with Marginal Errors. Yo-Sub Han, Sang-Ki Ko, Kai Salomaa |
| 2015 | Grammar-Based Tree Compression. Markus Lohrey |
| 2015 | Interval Exchange Words and the Question of Hof, Knill, and Simon. Zuzana Masáková, Edita Pelantová, Stepán Starosta |
| 2015 | Minimal Reversible Deterministic Finite Automata. Markus Holzer, Sebastian Jakobi, Martin Kutrib |
| 2015 | Multi-sequential Word Relations. Ismaël Jecker, Emmanuel Filiot |
| 2015 | On Decidability of Intermediate Levels of Concatenation Hierarchies. Jorge Almeida, Jana Bartonová, Ondrej Klíma, Michal Kunc |
| 2015 | On Distinguishing NC Andreas Krebs, Klaus-Jörn Lange, Michael Ludwig |
| 2015 | On the Complexity of k-Piecewise Testability and the Depth of Automata. Tomás Masopust, Michaël Thomazo |
| 2015 | On the Density of Context-Free and Counter Languages. Joey Eremondi, Oscar H. Ibarra, Ian McQuillan |
| 2015 | On the Size of Two-Way Reasonable Automata for the Liveness Problem. Maria Paola Bianchi, Juraj Hromkovic, Ivan Kovác |
| 2015 | Palindromic Complexity of Trees. Srecko Brlek, Nadia Lafrenière, Xavier Provençal |
| 2015 | Path Checking for MTL and TPTL over Data Words. Shiguang Feng, Markus Lohrey, Karin Quaas |
| 2015 | Recognisable Languages over Monads. Mikolaj Bojanczyk |
| 2015 | Squareable Words. Francine Blanchet-Sadri, Abraham Rashin |
| 2015 | State Complexity of Neighbourhoods and Approximate Pattern Matching. Timothy Ng, David Rappaport, Kai Salomaa |
| 2015 | Surminimisation of Automata. Victor Marsault |
| 2015 | The Boundary of Prefix-Free Languages. Jozef Jirásek, Galina Jirásková |
| 2015 | Transfinite Lyndon Words. Luc Boasson, Olivier Carton |
| 2015 | Unary Patterns with Permutations. James D. Currie, Florin Manea, Dirk Nowotka |
| 2015 | Unary Probabilistic and Quantum Automata on Promise Problems. Aida Gainutdinova, Abuzer Yakaryilmaz |
| 2015 | Weight Assignment Logic. Vitaly Perevoshchikov |