| Type | Title | Author | Publisher | Year |
| Article | Non-uniform automata over groups | Barrington, D.A.M., Straubing, H., Therien, D. | | 1990 |
| Article | Nonacceptability criteria and closure properties for the class of languages accepted by binary systolic tree automata | Fachini, E., Schenttini, A.M., Resta, G., Sangiorgi, D. | | 1991 |
| Article | On the complexity of the general coloring problem | Maurer, H.A., Sudborough, J.H., Welzl, E. | | 1981 |
| Article | On the regularity of wquality languages | Karhumaki, J. | | 1984 |
| Article | Costoc: computer supported teaching of computer science | Makedon, F., Maurer, H. | | 1986 |
| Article | Testing the necklace condition for shortest tours and optimal factors in the plane | Edelsbrunner, H., Rote, G., Welzl, E. | | 1986 |
| Article | Test sets for context free langauges and algebraic systems of equations over a free monoid | Albert, J., Culik II, K., Karhumaki, J. | | 1982 |
| Article | Systems of equations over a free monoid and Ehrenfeucht's conjecture | Culik II, K., Karhumaki, J. | | 1983 |
| Article | On binary equality sets and a solution to the test set conjecture in the binary case | Ehrenfeucht, A., Karhumaki, J, Rozenberg, G. | | 1983 |
| Article | Test sets for morphisms with bounded delay | Choffrut, C., Karhumaki, J. | | 1985 |
| Article | Fixed point languages, equality languages, and representation of recursively enumerable languages | Engelfriet, J., Rozenberg, G. | | 1980 |
| Article | On some relations defined by languages | Novotny, M. | | |
| Article | Systolic trellis automata | Culik II, K., Gruska, J., Salomaa, A. | | 1984 |
| Article | Obohaceni kombinatoriky pro vyuziti ridicich jazyku při studiu syntaxi rizeneho a rozkladoveho prekladu | Puchyrova, H. | | 1987 |
| Article | On multiple grammars | Kral, J. | | 1969 |
| Article | Synchronized E0L forms under uniform interpretation | Maurer, H.A., Salomaa, A., Wood, D. | | 1981 |
| Article | An „Interchange lemma“ for context-free languages | Ogden, W., Ross, R.J., Winklmann, K. | | 1985 |
| Article | On minimal graphs | Fellner, W.D. | | 1982 |
| Article | Three hierarchies of transducers | Engelfriet, J. | | 1982 |
| Article | A note on the succinctness of descriptions of deterministic languages | Valiant, L.G. | | 1976 |
| Article | The equivalence of four extensions of context-free grammars | Vijay-Shanker, K., Weir, D.J. | | 1992 |
| Article | Iterative reading of numbers: Parikh mappings, parallel rewriting, infinite sequences | Dassow, J., Marcus, S., Paun, Gh. | | 1993 |
| Article | Category theory and models for parallel computation | Winskel, G. | | |
| Article | One abstract accepting algorithm for all kinds of parsers | Deussen, P. | | |
| Article | Hypermap rewriting: a combinatorial approach | Sopena, E. | | 1991 |
| 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 |
