393 | -- | 0 | Helmut Jürgensen. Editorial |
395 | -- | 410 | Suna Aydin, Helmut Jürgensen, Lynda E. Robbins. Dialogues as Co-Operating Grammars |
411 | -- | 426 | Henning Bordihn, Markus Holzer. On the Number of Active Symbols in L and CD Grammar Systems |
427 | -- | 436 | Pál Dömösi, Zoltán Ésik. Homomorphic Simulation and Letichevsky s Criterion |
437 | -- | 452 | Christian Glaßer, Heinz Schmitz. The Boolean Structure of Dot-Depth One |
453 | -- | 466 | Markus Holzer, Kai Salomaa, Sheng Yu. On the State Complexity of k-Entry Deterministic Finite Automata |
467 | -- | 480 | Bakhadyr Khoussainov, Sasha Rubin. Graphs with Automatic Presentations over a Unary Alphabet |
481 | -- | 492 | Massimiliano Milani, Giovanni Pighizzini. Tight Bounds on the Simulation of Unary Probabilistic Automata by Deterministic Automata |
493 | -- | 506 | Frantisek Mráz. Lookahead Hierarchies of Restarting Automata |
507 | -- | 518 | Taishin Y. Nishida. Sizes of Context-Free Languages Generated by Context-Free Grammars and Stable and Recurrent 0L Systems |
519 | -- | 535 | Alexander Okhotin. Conjunctive Grammars |
537 | -- | 554 | Jeffrey Shallit, Ming-wei Wang. Automatic Complexity of Strings |
555 | -- | 568 | K. G. Subramanian, D. G. Thomas, P. Helen Chandra, Maia Hoeberechts. Basic Puzzle Grammars and Generation of Polygons |
569 | -- | 579 | Yuri Velinov. On the Regions of Influence in Complex Decomposition Forms of Finite Functions |