| 941 | -- | 944 | Hsu-Chun Yen, Oscar H. Ibarra. Preface |
| 945 | -- | 954 | Arto Salomaa, Kai Salomaa, Andrew L. Szilard. Goodby to the Kindhearted Dragon Prof. Sheng Yu, 1950-2012 |
| 955 | -- | 978 | Juraj Hromkovic, Rastislav Královic, Richard Královic, Richard Stefanec. Determinism vs. Nondeterminism for Two-Way Automata: Representing the Meaning of States by Logical Formulæ |
| 979 | -- | 994 | Kazuo Iwama, Harumichi Nishimura. Recovering Strings in Oracles: Quantum and Classic |
| 995 | -- | 1008 | Erzsébet Csuhaj-Varjú. P and DP Automata: Unconventional versus Classical Automata |
| 1009 | -- | 1028 | Janusz A. Brzozowski, Hellis Tamm. Complexity of atoms of Regular Languages |
| 1029 | -- | 1048 | Zoltán Ésik, Satoshi Okawa. On Context-Free Languages of Scattered Words |
| 1049 | -- | 1066 | Tommi Lehtinen, Alexander Okhotin. Homomorphisms Preserving Deterministic Context-Free Languages |
| 1067 | -- | 1082 | Yo-Sub Han, Sang-Ki Ko, Kai Salomaa. The Edit-Distance between a Regular Language and a Context-Free Language |
| 1083 | -- | 1098 | Markus Holzer, Sebastian Jakobi. From Equivalence to Almost-Equivalence, and beyond: Minimizing Automata with Errors |
| 1099 | -- | 1116 | Michaël Cadilhac, Alain Finkel, Pierre McKenzie. Unambiguous constrained Automata |
| 1117 | -- | 1134 | Markus L. Schmid. Inside the Class of regex Languages |
| 1135 | -- | 1152 | Juhani Karhumäki, Svetlana Puzynina, Aleksi Saarela. Fine and Wilf's Theorem for k-Abelian Periods |
| 1153 | -- | 1166 | Alexandre Blondin Massé, Sarah Desmeules, Sébastien Gaboury, Sylvain Hallé. Multipseudoperiodic Words |
| 1167 | -- | 0 | Viliam Geffert, Dana Pardubská. Unary Coded NP-Complete Languages in Aspace(log log n) |