| 831 | -- | 850 | Janusz A. Brzozowski, Helmut Jürgensen. Representation of semiautomata by canonical words and equivalences |
| 851 | -- | 865 | Jean-Marc Champarnaud, Franck Guingne, Georges Hansel. Cover transducers for functions with finite domain |
| 867 | -- | 881 | Zhe Dang, Oscar H. Ibarra. On one-membrane P systems operating in sequential mode |
| 883 | -- | 896 | Michael Domaratzki, Keith Ellul, Jeffrey Shallit, Ming-wei Wang. Non-uniqueness and radius of cyclic unary NFAs |
| 897 | -- | 912 | Michael Domaratzki, Kai Salomaa. Restricted sets of trajectories and decidability of shuffle decompositions |
| 913 | -- | 928 | Piotr Faliszewski, Lane A. Hemaspaandra. Advice for semifeasible sets and the complexity-theoretic cost(lessness) of algebraic properties |
| 929 | -- | 942 | Rudolf Freund, Marion Oswald, Andrei Paun. Optimal results for the computational completeness of gemmating (tissue) P systems |
| 943 | -- | 956 | Christos A. Kapoutsis. Non-recursive trade-offs for two-way machines |
| 957 | -- | 973 | Martin Kutrib. The phenomenon of non-recursive trade-offs |
| 975 | -- | 984 | Hing Leung. Descriptional complexity of nfa of different ambiguity |
| 985 | -- | 998 | Alexander Okhotin. A characterization of the arithmetical hierarchy by language equations |
| 999 | -- | 1010 | Libor Polák. Minimalizations of NFA using the universal automaton |
| 1011 | -- | 1025 | Bettina Sunckel. On the descriptional complexity of metalinear cd grammar systems |
| 1027 | -- | 1038 | Lynette van Zijl. Magic numbers for symmetric difference NFAS |
| 1039 | -- | 1070 | Lila Kari, Stavros Konstantinidis, Petr Sosík. Bond-free languages: formalizations, maximality and construction methods |