| 139 | -- | 142 | Igor Potapov, Pavel Semukhin. Preface |
| 143 | -- | 164 | Hideo Bannai, Travis Gagie, Shunsuke Inenaga, Juha Kärkkäinen, Dominik Kempa, Marcin Piatkowski, Shiho Sugimoto. Diverse Palindromic Factorization is NP-Complete |
| 165 | -- | 186 | Dietmar Berwanger, Marie van den Bogaard. Consensus Game Acceptors and Iterated Transductions |
| 187 | -- | 212 | Maria Paola Bianchi, Juraj Hromkovic, Ivan Kovác. On the Size of Two-Way Reasonable Automata for the Liveness Problem |
| 213 | -- | 232 | Christopher Czyba, Wolfgang Thomas, Christopher Spinrath. Finite Automata Over Infinite Alphabets: Two Models with Transitions for Local Change |
| 233 | -- | 250 | Joey Eremondi, Oscar H. Ibarra, Ian McQuillan. On the Density of Context-Free and Counter Languages |
| 251 | -- | 270 | Markus Holzer 0001, Sebastian Jakobi, Martin Kutrib. Minimal Reversible Deterministic Finite Automata |
| 271 | -- | 296 | Ismaël Jecker, Emmanuel Filiot. Multi-Sequential Word Relations |
| 297 | -- | 314 | Ines Klimann, Matthieu Picantin, Dmytro Savchuk. A Connected 3-State Reversible Mealy Automaton Cannot Generate an Infinite Burnside Group |
| 315 | -- | 0 | Timothy Ng 0001, David Rappaport, Kai Salomaa. State Complexity of Neighbourhoods and Approximate Pattern Matching |