One-sided forbidding grammars and selective substitution grammars

References

• Dassow , J. and Păun , G. 1989 . Regulated Rewriting in Formal Language Theory , New York : Springer .
   Google Scholar
• Ehrenfeucht , A. , Kleijn , H. C.M. and Rozenberg , G. 1985 . Adding global forbidding context to context-free grammars . Theoret. Comput. Sci. , 37 : 337 – 360 .
   Web of Science ®Google Scholar
• Goldefus , F. , Masopust , T. and Meduna , A. 2010 . Left-forbidding cooperating distributed grammar systems . Theoret. Comput. Sci. , 20 : 1 – 11 .
   Google Scholar
• Gonczarowski , J. , Kleijn , H. C.M. and Rozenberg , G. 1983 . Closure properties of selective substitution grammars (part I) . Int. J. Comput. Math. , 14 : 19 – 42 .
   Web of Science ®Google Scholar
• Gonczarowski , J. , Kleijn , H. C.M. and Rozenberg , G. 1983 . Closure properties of selective substitution grammars (part II) . Int. J. Comput. Math. , 14 : 109 – 135 .
   Web of Science ®Google Scholar
• Gonczarowski , J. , Kleijn , H. C.M. and Rozenberg , G. 1984 . Grammatical constructions in selective substitution grammars . Acta Cybernet. , 6 : 239 – 269 .
   Google Scholar
• Kleijn , H. C.M. “ Selective substitution grammars based on context-free productions ” . Ph.D. thesis, Leiden University, Netherlands, 1983.
   Google Scholar
• Kleijn , H. C.M. 1987 . “ Basic ideas of selective substitution grammars ” . In Trends, Techniques, and Problems in Theoretical Computer Science , Edited by: Kelemenová , A. and Kelemen , J. Vol. 281 , 75 – 95 . Berlin : Springer . Lecture Notes in Computer Science
   Google Scholar
• Kleijn , H. C.M. and Rozenberg , G. 1981 . Context-free like restrictions on selective rewriting . Theoret. Comput. Sci. , 16 : 237 – 269 .
   Web of Science ®Google Scholar
• Kleijn , H. C.M. and Rozenberg , G. 1981 . “ A general framework for comparing sequential and parallel rewriting ” . In Mathematical Foundations of Computer Science , Edited by: Gruska , J. and Chytil , M. 360 – 368 . London : Springer .
   Google Scholar
• Kleijn , H. C.M. and Rozenberg , G. 1981 . On the role of selectors in selective substitution grammars . Fundam. Comput. Theory , 117 : 190 – 198 .
   Google Scholar
• Kleijn , H. C.M. and Rozenberg , G. 1981 . Sequential, continuous and parallel grammars . Inf. Control. , 48 : 221 – 260 .
   Google Scholar
• Kleijn , H. C.M. and Rozenberg , G. 1983 . On the generative power of regular pattern grammars . Acta Inform. , 20 : 391 – 411 .
   Web of Science ®Google Scholar
• Lomkovskaya , M. V. 1972 . On some properties of c-conditional grammars . Nauchno-Tekhn. Informatsiya , 2 : 16 – 21 . (in Russian).
   Google Scholar
• Martín-Vide , C. , Mitrana , V. and Păun , G. 2004 . Formal Languages and Applications , Edited by: Martín-Vide , C. , Mitrana , V. and Păun , G. Berlin : Springer .
   Google Scholar
• Masopust , T. 2007 . “ Generalized forbidding grammars with linear productions ” . 121 – 126 . Third Doctoral Workshop on Mathematical and Engineering Methods in Computer Science (MEMICS 2007), Znojmo, Czech Republic
   Google Scholar
• Masopust , T. 2009 . On the terminating derivation mode in cooperating distributed grammar systems with forbidding components . Internat. J. Found. Comput. Sci. , 20 : 331 – 340 .
   Web of Science ®Google Scholar
• Meduna , A. 1990 . Generalized forbidding grammars . Internat. J. Comput. Math. , 36 : 31 – 38 .
   Web of Science ®Google Scholar
• Meduna , A. 2000 . Automata and Languages: Theory and Applications , London : Springer .
   Google Scholar
• Meduna , A. and Švec , M. 2003 . Forbidding ET0L grammars . Theoret. Comput. Sci. , 306 : 449 – 469 .
   Web of Science ®Google Scholar
• Meduna , A. and Zemek , P. 2011 . One-sided random context grammars . Acta Inform. , 48 : 149 – 163 .
   Web of Science ®Google Scholar
• Penttonen , M. 1975 . ET0L-grammars and N-grammars . Inform. Process. Lett. , 4 : 11 – 13 .
   Google Scholar
• Rozenberg , G. 1977 . Selective substitution grammars (towards a framework for rewriting systems). Part 1: Definitions and examples . Elektron. Inf.verarb. Kybern. , 13 : 455 – 463 .
   Google Scholar
• Rozenberg , G. 1985 . On coordinated selective substitutions: Towards a unified theory of grammars and machines . Theoret. Comput. Sci. , 37 : 31 – 50 .
   Web of Science ®Google Scholar
• Rozenberg , G. and Salomaa , A. 1997 . Handbook of Formal Languages , Edited by: Rozenberg , G. and Salomaa , A. Vol. 1–3 , New York : Springer .
   Google Scholar
• Siromoney , R. and Dare , V. R. 1985 . On infinite words obtained by selective substitution grammars . Theoret. Comput. Sci. , 39 : 281 – 295 .
   Web of Science ®Google Scholar
• Siromoney , R. and Subramanian , K. G. 1981 . Selective substitution array grammars . Inform. Sci. , 25 : 73 – 83 .
   Web of Science ®Google Scholar
• van der Walt , A. P.J. and Ewert , S. 2000 . A shrinking lemma for random forbidding context languages . Theoret. Comput. Sci. , 237 : 149 – 158 .
   Web of Science ®Google Scholar