| Type | Title | Author | Publisher | Year |
| Article | A surprising undecidability result: the equivalence problem for finite substitutions on ab^*c | Karhumaki, J., Lisovik, L. | | 2002 |
| Article | Succintness of descriptions of context-free, regular, and finite languages | Schmidt, E.M. | | 1978 |
| Article | Jazyky a preklady | Melichar, B. | | 1999 |
| Article | Vycislitelnost a slozitost | Ceska, M., Motyckova, L., Hruska, T. | | 1992 |
| Article | Jazyky a prekladace | Melichar, B. | | 2003 |
| Article | Algebraic construction of compilers | Rus, T. | | 1991 |
| Article | Internation journal of computer mathematics vol. 83 no. 1 | Twizell, E.H. | | 2006 |
| Article | Undecidability of the equivalence of finite substitutions on regular language | Halava, H., Harju, T. | | 1998 |
| Article | Iteration of transformation passes over attributed program trees | Ablas, H. | | 1989 |
| Article | Fuzzy grammars and recursively enumerable fuzzy languages | Gerla, G. | | 1992 |
| Article | On the synchronization in parallel communicating grammar systems | Paun, Gh. | | 1993 |
| Article | Accepting grammars and systems via context condition grammars | Bordihn, H., Fernau, H. | | 1996 |
| Article | Graph-controlled grammars as language acceptors | Fernau, H. | | 1997 |
| Article | Scattered context grammars with regulation | Fernau, H. | | 1996 |
| Article | On grammars with local and global context conditions | Csuhaj-Varju, E. | | 1993 |
| Article | A sentence generator for testing parsers | Purdom, P. | | 1972 |
| Article | One-pass transformations of attributed program trees | Ablas, H. | | 1987 |
| Article | The topological entropy of cellular automata is uncomputable | Hurd, L.P., Kari, J., Culik, K. | | 1992 |
| Article | The VLDB Journal 10/2--3 | | | 2001 |
| Article | Hypergraph languages of bounded degree | Engelfriet, J., Heyker, L. | | 1994 |
| Article | Context-free graph languages of bounded degree are generated by apex graph grammars | Engelfriet, J., Heyker, L., Leih, G. | | 1994 |
| Article | Rice's theorem for the limit sets of cellular automata | Kari, J. | | 1994 |
| Article | Reversibility and surjectivity problems of cellular automata | Kari, J. | | 1994 |
| Article | Reversibility of 2D cellular automata is undecidable | Kari, J. | | 1990 |
| Article | Wachsende kontextsensitive sprachen | Buntock, G. | | 1996 |
| 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 |
