A formalization of sequential, parallel, and continuous rewriting

References

• Ehrenfeucht , A. , Kleijn , H. C. M. and Rozenberg , G. 1985 . Adding global forbidding context to context-free grammars . Theoretical Computer Science , 37 : 337 – 360 .
   Web of Science ®Google Scholar
• Kleijn , H. C. M. and Rozenberg , G. 1983 . Multi grammars . Intemational Journal of Computer Mathematics , 12 : 177 – 201 .
   Web of Science ®Google Scholar
• Kleijn , H. C. M. and Rozenberg , G. 1981 . Sequential, continuous, and parallel grammars . Information and Control , 48 : 221 – 260 .
   Google Scholar
• Meduna , A. 1987 . Characterization of the Chomsky hierarchy through sequential-parallel grammars . Rostock. Math. Kolloq. , 32 : 4 – 14 .
   Google Scholar
• Meduna , A. 1990 . Generalized forbidding grammars . Inter. J. Computer Math. , 36 : 31 – 38 .
   Web of Science ®Google Scholar
• Meduna , A. 1991 . Global context condition grammars . J. Inform. Process. Cybern. , 27 : 159 – 165 .
   Google Scholar
• Meduna , A. 1990 . Context free derivations on word monoids . Acta Informatica , 27 : 781 – 786 .
   Google Scholar
• Penttonen , M. 1974 . One-sided and two-sided context in formal grammars . Inform. Contr. , 25 : 371 – 392 .
   Google Scholar
• Rozenberg , G. 1977 . Selective substitution grammars . J. Inform. Process. Cybern. , 13 : 455 – 463 .
   Google Scholar
• Salomaa , A. 1973 . Formal Languages , New York : Academic Press .
   Google Scholar