| Type | Title | Author | Publisher | Year |
| Article | Random Context Languages | van der Walt, A. | | 1971 |
| Article | Prispevek ke vztahu Fareyovy rady a Riemannovy domnenky | Kopriva, J. | | 1954 |
| Article | Magic Numbers in the State Hierarchy of Finite Automata | Geffert, V. | | 2006 |
| Article | A super normal form theorem for context-free grammars | Maurer, H.A., Salomaa, A., Wood, D. | | 1980 |
| Article | Accepting Grammars and Systems | Bordihn, H., Fernau, H. | | 1995 |
| Article | On some structural properties of a subclass of inftinity-regular languages | Meznik, I. | | 1987 |
| Article | On Pebble Automata | Chang, J.H., Ibarra, O.H., Palis, M.A. | | 1986 |
| Article | Complete systems of B-rational identities in TCS volume 89, no. 2 | Krob, D. | | 1991 |
| Article | How to make arbitrary grammars look like context-free grammars | Savitch, W.J. | | 1973 |
| Article | On representing RE languages by one-sided interna contextual languages | Ehrenfeucht, A., Mateescu, A., Paun, Gh., Rozenberg, G., Salomaa, A. | | 1995 |
| Article | On Some Special Classes of Regular Languages | Imreh, B., Ito, M. | | |
| Article | JL systems with non-fragmented axioms: the hierarchy | Ruohonen, K. | | 1975 |
| Article | On the Impossibility of the Homomorphic Characterization of Context-Sensitive Languages | Okawa, S., Hirose, S., Yoneda, M. | | 1986 |
| Article | HDT0L matching of computations of multitape automata | Culik II, K., Karhumaki, J. | | 1989 |
| Article | A recognition algorithm for pushdown store systems | Aho, A.V., Hopcroft, J.E., Ullman, J.D. | | |
| Article | A grammatical model of learning and fallibility | Kelemen, J. | | 1986 |
| Article | A New-Old Class of Linguistically Motivated Regulated Grammars | Marcus, S., Martín-Vide, C., Mitrana, V., Paun, Gh. | | |
| Article | Rational algebraic theories and fixed-point solutions | Wright, J.B., Thatcher, J.W., Wagner, E.G. | | 1976 |
| Article | Two-Way Pushdown Automata | Gray, J.N., Harrison, M.A., Ibarra, O.H. | | 1967 |
| Article | Systolicke vypocty a automaty | Gruska, J. | | 1982 |
| Article | One-Way Stack Automata | Ginsburg, S., Greibach, S.A., Harrison, M.A. | | 1967 |
| Article | A note on language equations involving morphisms | Ruohonen, K. | | 1978 |
| Article | Ambiguity in Context Free Languages | Ginsburg, S., Ullian, J. | | 1964 |
| Article | Corrigendum; sequential, continuous, and parallel grammars | Kleijn, H.C.M., Rozenberg, G. | | 1982 |
| Article | Stack Automata and Compiling | Ginsburg, S., Greibach, S.A., Harrison, M.A. | | 1967 |
| 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 |
