| Type | Title | Author | Publisher | Year |
| Article | Gramaticke kategorie a „pojmy v situacich“ | Novotny, M. | | 1988 |
| Article | Automaty a mozek | Kopriva, J. | | 1964 |
| Article | | | | |
| Article | O jistem systemu topologii v danem prostoru | Kopriva, J. | | 1957 |
| Article | A Supernormal-Form Theorem for Context-Free Grammars | Maurer, H.A., Salomaa, A., Wood, D. | | 1983 |
| Article | Outfix and Infix codes and related classes of languages | Ito, M., Jurgensen, H., Shyr, H.J., Thierring, G. | | 1991 |
| Article | Iterative Tree Arrays with Logarithmic Depth | Culik II, K., Yu, S., Ibarra, O.H. | | 1986 |
| Article | Translational lemmas, polynomial time, and (log n)^j-space | Book, R.V. | | 1976 |
| Article | Topological Transformations as a tool in the design of systolic networks | Culik II, K., Fris, I. | | 1985 |
| Article | Square-free words on partially commutative free monoids | Carpi, A., De luca, A. | | 1986 |
| Article | Characterizing Derivation Trees of Context-Free Grammars through a Generalization of Automata Theory | Thatcher, J.W. | | 1967 |
| Article | Zlozitost, zrozumitelnost a dokazovanie korektnosti programov a algoritmov | Gruska, J. | | |
| Article | It is decidable whether a regular language is pure context-free | Bucher, W., Hagauer, J. | | 1983 |
| Article | Expanded subalphabets in the theories of languages and semigroups | Head, T. | | 1982 |
| Article | Characterizing Derivation Trees of Context-Free Grammars through a Generalization of Automata Theory | Thatcher, J.W. | | 1967 |
| Article | On generators and generative capacity of E0L forms | Maurer, H.A., Salomaa, A., Wood, D. | | 1978 |
| Article | Literal Homomorphisms of 0L-Languages | Culik II, K., Opatrny, J. | | 1974 |
| Article | Untersuchungen zur detektion und lokalisation markanter punkte in farbbildern | Bartsch, T. | | 1987 |
| Article | The ultimate Equivalence Problem for D0L Systems | Culik II, K. | | 1978 |
| Article | Modelling Kohonen networks by attributed parallel array systems | Freund, R., Tafill, F. | | |
| Article | A Direct Proof of the Inherent Ambiguity of a Simple Context-Free Language | Maurer, H.A. | | 1969 |
| Article | Node-label controlled graph grammars with context conditions | von Solms, S.H. | | 1984 |
| Article | Programmable Finite Automata for VLSI | Culik II, K., Jurgensen, H. | | 1983 |
| Article | Colorings and interpretations: a connection between graphs and grammar forms | Maurer, H.A., Salomaa, A., Wood, D. | | 1981 |
| Article | A Remark on Regularity of Parallel Languages | Ruohonen, K. | | 1982 |
| 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 |
