References
- Dassow , J. and Paun , G. 1989 . Regulated Rewriting in Formal Language Theory , New York : Springer .
- Kleijn , H. C. M. and Rozenberg , G. 1983 . On the Generative Power of Regular Pattern Grammars . ACTA Informatica , 20 : 391 – 411 .
- Meduna , A. 1987 . Characterization of the Chomsky Hierarchy through Sequential-Parallel Grammars . Rostock. Math. Kolloq , 32 : 4 – 14 .
- Meduna , A. and Horvath , G. 1988 . On State Grammars . Acta Cybernetica , 8 : 237 – 245 .
- Meduna , A. 1990 . Context Free Derivations on Word Monoids . Acta Informatica , 27 : 781 – 786 .
- Meduna , A. 1990 . Generalized Forbidding Grammars . International Journal of Computer Mathematics , 36 : 31 – 38 .
- Meduna , A. 1991 . Global Context Conditional Grammars . J. Inform. Process. Cybern , 27 : 159 – 165 .
- Meduna , A. 1992 . Symbiotic EOL Systems . Acta Cybernetika , 12 : 164 – 172 .
- Meduna , A. 1992 . A Formalization of Sequential, Parallel, and Continuous Rewriting . International Journal of Computer Mathematics , 42 : 24 – 32 .
- Meduna , A. and Gopalaratnam , M. 1994 . On Semi-Conditional Grammars with Productions Having either Forbidding or Permitting Conditions . Acta Cybernetica , 11 : 309 – 323 .
- Meduna , A. 1995 . A Trivial Method of Characterizing the Family of Recursively Enumerable Languages by Scattered Context Grammars . EATCS Bulletin , 56 : 104 – 106 .
- Meduna , A. 1997 . Four-Nonterminal Scattered Context Grammars Characterize the Family of Recursively Enumerable Languages . International Journal of Computer Mathematics , 63 : 67 – 83 .
- Meduna A. Six-Nonterminal Multi-Sequential Grammars Characterize the Family of Recursively Enumerable Languages International Journal of Computer Mathematics in press