| Type | Title | Author | Publisher | Year |
| Article | Programmable Finite Automata for VLSI | Culik II, K., Jurgensen, H. | | 1983 |
| Article | The ultimate Equivalence Problem for D0L Systems | Culik II, K. | | 1978 |
| Article | Semirings and formal power series | Droste, M., Kuich, W. | | |
| Article | On Superreducts | Novotny, M., Pawlak, Z. | | 1990 |
| Article | Metodika hodnoceni vlivu parametru na propustnost lokalni pocitacove site | Sarek, M. | | 1988 |
| Article | On Invertible Cellular Automata | Culik II, K. | | 1987 |
| Article | Valence GSM-mappings | Marcus, M., Paun, Gh. | | 1987 |
| Article | Further remarks on pure grammars with regulated rewriting | Dassow, J., Paun, Gh. | | 1986 |
| Article | Grammars on Partial Graphs | Schneider, H.J., Ehrig, H. | | 1975 |
| Article | Algebraic Specification of the Software Controlling a Parcels Distribution Machine | Schneider, H.J. | | 1981 |
| Article | The derivation language of a phrase structure grammar | Hart, J.M. | | 1976 |
| Article | On Finite Grammar Forms | Maurer, H.A., Salomaa, A., Wood, D. | | 1983 |
| Article | Scattered context grammars that erase nonterminals in a generalized k-limited way | Meduna, A., Techet, J. | | 2008 |
| Article | Two Power-Decreasing Derivation Restrictions in Generalized Scattered Context Grammars | Masopust, T., Meduna, A., Šimáček, J. | | 2008 |
| Article | On Pure Multi-Pushdown Automata that Perform Complete Pushdown Pops | Masopust, T., Meduna, A. | | 2009 |
| Article | Terminating left-hand sides of scattered context productions | Meduna, A. | | 2000 |
| Article | Economical Transformations of Phrase-Structure Grammars to Scattered Context Grammars | Meduna, A. | | 1998 |
| Article | Forbidding ET0L grammars | Meduna, A., Švec, M. | | 2003 |
| Article | On Predecessors of Finite Languages | Maurer, H.A., Salomaa, A., Wood, D. | | 1981 |
| Article | Decidebility and density in two-symbol grammar forms | Maurer, H.A., Salomaa, A., Wood, D. | | 1981 |
| Article | Literal Homomorphisms of 0L-Languages | Culik II, K., Opatrny, J. | | 1974 |
| Article | | | | |
| Article | Characterizing Derivation Trees of Context-Free Grammars through a Generalization of Automata Theory | Thatcher, J.W. | | 1967 |
| Article | It is decidable whether a regular language is pure context-free | Bucher, W., Hagauer, J. | | 1983 |
| Article | Characterizing Derivation Trees of Context-Free Grammars through a Generalization of Automata Theory | Thatcher, J.W. | | 1967 |
| 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 |
