| 117 | -- | 118 | Cristian Calude, Kai Salomaa, Sheng Yu. Advances and Trends in Automata and Formal Languages A Collection of Papers in Honour of the 60th Birthday of Helmut Jürgensen - J.UCS Special Issue |
| 119 | -- | 140 | Henning Bordihn, Markus Holzer. On the Computational Complexity of Synchronized Context-Free Languages |
| 141 | -- | 152 | Cristian Calude, Kai Salomaa, Sheng Yu. Additive Distances and Quasi-Distances Between Words |
| 153 | -- | 172 | Dana Cristofor, Dan A. Simovici. Finding Median Partitions Using Information-Theoretical-Based Genetic Algorithms |
| 173 | -- | 183 | Zoltán Ésik, Werner Kuich. Rationally Additive Semirings |
| 184 | -- | 192 | Ferenc Gécseg. On Quasi-Products of Tree Automata |
| 193 | -- | 234 | Jonathan Goldstine, Martin Kappes, Chandra M. R. Kintala, Hing Leung, Andreas Malcher, Detlef Wotschke. Descriptional Complexity of Machines with Limited Resources |
| 235 | -- | 242 | Peter Hertling. Simply Normal Numbers to Different Bases |
| 243 | -- | 256 | H. K. Hsiao, C.-C. Huang, S. S. Yu. Word Operation Closure and Primitivity of Languages |
| 257 | -- | 259 | Masami Ito. Shuffle Decomposition of Regular Languages |
| 260 | -- | 269 | Masami Ito, Jürgen Dassow, Ralf Stiebe. Some Remarks on Codes Defined by Petri Nets |
| 270 | -- | 277 | Jarkko Kari. Synchronization and Stability of Finite Automata |
| 278 | -- | 291 | Stavros Konstantinidis. Error-Correction, and Finite-Delay Decodability |
| 292 | -- | 296 | Solomon Marcus. Bridging Two Hierarchies of Infinite Words |
| 317 | -- | 331 | Carlos Martín-Vide, Andrei Paun, Gheorghe Paun. On the Power of P Systems with Symport Rules |
| 332 | -- | 347 | Arto Salomaa. Generation of Constants and Synchronization of Finite Automata |
| 348 | -- | 362 | Ludwig Staiger. How Large is the Set of Disjunctive Sequences? |
| 363 | -- | 367 | Bruce W. Watson. A Fast and Simple Algorithm for Constructing Minimal Acyclic Deterministic Finite Automata |