| Type | Title | Author | Publisher | Year |
| Article | A sentence generator for testing parsers | Purdom, P. | | 1972 |
| Article | Iteration of transformation passes over attributed program trees | Ablas, H. | | 1989 |
| Article | One-pass transformations of attributed program trees | Ablas, H. | | 1987 |
| Article | On semi-conditional grammars with productions having either forbidding or permitting conditions | Meduna, A., Gopalaratnam, A. | | 1994 |
| Article | Inauguracni prednaska ke jmenovani profesorem | Szendiuch, I. | | 1999 |
| Article | Matematicky nastroj pro analyzu PWM signalu, jeho uziti ve stridavych pohonech | Patocka, M. | | 1999 |
| Article | On semi-conditional grammars with productions having either forbidding or permitting conditions | Meduna, A., Gopalaratnam, A. | | 1994 |
| Article | On cooperating/distributed grammar systems | Csuhaj-Varju, E., Dassow, J. | | 1990 |
| Article | Formalni pristup k analyze testovatelnosti cislicovych obvodu na urovni RT | Ruzicka, R. | | |
| Article | Rostocker mathemathisches kolloquium 59 | | | 2005 |
| Article | Transductions and the parallel generation of languages | Culik II, K., Head, T. | | 1983 |
| Article | The VLDB Journal 10/2--3 | | | 2001 |
| Article | Wachsende kontextsensitive sprachen | Buntock, G. | | 1996 |
| Article | Reversibility of 2D cellular automata is undecidable | Kari, J. | | 1990 |
| Article | Reversibility and surjectivity problems of cellular automata | Kari, J. | | 1994 |
| Article | Rice's theorem for the limit sets of cellular automata | Kari, J. | | 1994 |
| Article | Context-free graph languages of bounded degree are generated by apex graph grammars | Engelfriet, J., Heyker, L., Leih, G. | | 1994 |
| Article | Hypergraph languages of bounded degree | Engelfriet, J., Heyker, L. | | 1994 |
| Article | The topological entropy of cellular automata is uncomputable | Hurd, L.P., Kari, J., Culik, K. | | 1992 |
| Article | The translation power of top-down tree-to-graph transducers | Engelfriet, J., Vogler, H. | | 1994 |
| Article | Context-free hypergraph grammars have the same term-generating power as attribute grammars | Engelfriet, J., Heyker, L. | | 1992 |
| Article | Handle-rewriting hypergraph grammars | Courcelle, B., Engelfriet, J., Rozenberg, G. | | 1993 |
| Article | A decentralized control parallel interpreter for arithmetic expressions ans its evaluation | Baccelli, F., Mussi, P. | | 1983 |
| Article | On parsing arithmetic expressions in a multiprocessing environment | Baccelli, F., Fleury, T. | | 1982 |
| Article | On representing recursively enumerable languages by internal contextual langauges | Ehrenfeucht, A., Paun, G., Rozenberg, G. | | 1994 |
| 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 |
