| Type | Title | Author | Publisher | Year |
| Article | Applications of scheduling theory to formal language theory | Gonczarowski, J., Warmuth, M.K. | | 1985 |
| Article | Implementation of Sequential and Parallel Graph Rewriting Systems | Brendel, W., Nagl, M., Weber, D. | | 1978 |
| Article | Context free derivations on word monoids | Meduna, A. | | 1990 |
| Article | A dialog systém for the graphical representation of graphs | Nagl, M., Zischler, H. | | 1979 |
| Article | On non-regular context-free languages and pumping | Culik II, K., Gruska, J., Salomaa, A. | | |
| Article | Batched dynamic solutions to decomposable searching problems | Edelsbrunner, H., Overmars, M.H. | | 1983 |
| Article | Der fixpunktansatz zum beweis gewisser eigenschaften eines maschinenprogramms | Kopriva, J. | | |
| Article | A left part theorem for grammatical trees | Nijholt, A. | | 1979 |
| Article | Closure properties of selective substitution grammars | Gonczarowski, J., Kleijn, H.C.M., Rozenberg, G. | | 1983 |
| Article | Decidability and density in two-symbol grammar forms | Maurer, H.A., Salomaa, A., Wood, D. | | 1981 |
| Article | Systolic automata for VLSI on balanced trees | Culik II, K., Gruska, J., Salomaa, A. | | 1983 |
| Article | Context-free grammars forms | Cremers, A., Ginsburg, S. | | 1975 |
| Article | L homomorphisms and reductions of 0L systems | Lange, K.-J. | | 1982 |
| Article | Macro 0L-systems | Culik II, K., Opatrny, J. | | 1975 |
| Article | General formulation of formal grammars | Mizumoto, M., Toyoda, J., Tanaka, K. | | 1972 |
| Article | On epsilon productions for terminals in E0L forms | Ainhirn, W., Maurer, H.A. | | 1979 |
| Article | Comparison of some types of regulated rewriting | Dassow, J. | | |
| Article | Space-bounded complexity classes and iterated deterministic substitution | Asveld, P.R.J. | | 1980 |
| Article | Coping with the impresicion of the real world | Zadeh, L.A. | | 1984 |
| Article | Time and Space Complexity of Inside-Out Macro Languages | Asveld, P.R.J. | | 1981 |
| Article | Rule trees represent derivations in edge replacement systems | Kreowski, H.-J. | | 1986 |
| Article | Uniform interpretations of grammar forms | Maurer, H.A., Salomaa, A., Wood, D. | | 1981 |
| Article | Extending regular expressinos with iterated shuffle | Jantzen, M. | | 1984 |
| Article | A prime decomposition theorem for grammatical families | Ginsburg, S. | | 1982 |
| Article | A grammar-theoretic treatment of multiagent systems | Kelemen, J., Kelemenova, A. | | 1992 |
| 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 |
