| Type | Title | Author | Publisher | Year |
| Article | Decidability and density in two-symbol grammar forms | Maurer, H.A., Salomaa, A., Wood, D. | | 1981 |
| Article | Pushdown Automata with Counters | Kameda, T. | | 1972 |
| Article | Any linear language is weakly grammatizable by means of categories | Novotny, M. | | 1988 |
| Article | Pushdown Automata with Reversal-Bounded Counters | Chan, T.-H. | | 1988 |
| Article | On the complexity of formal grammars | Book, R.V. | | 1978 |
| Article | Random Grammars | Malyshev, V. | | 1997 |
| Article | Costoc: computer supported teaching of computer science | Makedon, F., Maurer, H. | | 1986 |
| Article | Turing Machines with Sublogarithmic Space | Szepietowski, A. | | 1994 |
| Article | Hypermap rewriting: a combinatorial approach | Sopena, E. | | 1991 |
| Article | On States Observability in Deterministic Finite Automata | Mateescu, A., Paun, Gh. | | 1987 |
| Article | Translation of systolic algorithms between systems of different topology | Culik II, K., Yu, S. | | 1985 |
| Article | Minimal Union-Free Decompositions of Regular Languages | Afonin, S., Golomazov, D. | | |
| Article | Applications of program transformation to program synthesis | Darlington, J. | | |
| Article | Finite Turns and the Regular Closure of Linear Context-Free Languages | Kutrib, M., Malcher, A. | | 2006 |
| Article | Nonzero structure analysis | Bik, A.J.C., Wiijshoff, H.A.G. | | 1994 |
| Article | Scattered Context Grammars | Greibach, S., Hopcroft, J. | | 1969 |
| Article | Hierarchy of k-context-free languages part 2 | Salomaa, K. | | 1989 |
| Article | Regulated Finite Index Language Families Collapse | Fernau, H., Holzer, M. | | 1996 |
| Article | Stochastische 0L-systeme | Schaffler, G. | | 1976 |
| Article | Formal Languages: Origins and Directions | Greibach, S. | | 1981 |
| Article | Two-symbols D0S systems generating regular languages | Bucher, W. | | 1983 |
| Article | A shrinking lemma for random forbidding context languages | Ewert, S., van der Walt, A. | | 2000 |
| Article | Morphic images of Gauss codes | Kari, J., Niemi, V. | | |
| Article | A pumping lemma for random permitting context languages | Ewert, S., van der Walt, A. | | 2002 |
| Article | The copying power of one-state tree transducers | Engelfriet, J., Skyum, S. | | 1982 |
| 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 |
