| 559 | -- | 561 | Oscar H. Ibarra, Bala Ravikumar. Preface |
| 563 | -- | 580 | Markus Holzer, Martin Kutrib. Nondeterministic Finite Automata - Recent Results on the Descriptional and Computational Complexity |
| 581 | -- | 596 | Hsu-Chun Yen. Path Decomposition and Semilinearity of Petri Nets |
| 597 | -- | 612 | Ryan Dixon, Ömer Egecioglu, Timothy Sherwood. Analysis of Bit-Split Languages for Packet Scanning and Experiments with Wildcard Matching |
| 613 | -- | 627 | Cyril Allauzen, Mehryar Mohri. N-Way Composition of Weighted Finite-State Transducers |
| 629 | -- | 645 | Giovanni Pighizzini. Deterministic Pushdown Automata and Unary Languages |
| 647 | -- | 667 | François Cantin, Axel Legay, Pierre Wolper. Computing Convex Hulls by Automata Iteration |
| 669 | -- | 684 | Marco Almeida, Nelma Moreira, Rogério Reis. Antimirov and Mosses s Rewrite System Revisited |
| 685 | -- | 700 | Parosh Aziz Abdulla, Ahmed Bouajjani, Lukás HolÃk, Lisa Kaati, Tomás Vojnar. Composed Bisimulation for Tree Automata |
| 701 | -- | 715 | Harald Hempel, Madlen Kimmritz. Aspects of Persistent Computations |
| 717 | -- | 733 | Tetsuya Matsumoto, Kazuhito Hagio, Masayuki Takeda. A Run-Time Efficient Implementation of Compressed Pattern Matching Automata |
| 735 | -- | 746 | Andrew Badr. HYPER-MINIMIZATION IN O(n:::2:::) |
| 747 | -- | 762 | Yih-Kuen Tsay, Bow-Yaw Wang. Automated Compositional Reasoning of Intuitionistically Closed Regular Properties |
| 763 | -- | 774 | Jean-Marc Champarnaud, Jean-Philippe Dubernard, Hadrien Jeanne. An Efficient Algorithm to Test Whether a Binary and Prolongeable Regular Language is Geometrical |