17
Views
2
CrossRef citations to date
0
Altmetric
Original Articles

Six-Nonterminal multi-sequential grammars characterize the family of recursively enumerable languages

Pages 179-189 | Received 20 Sep 1996, Published online: 19 Mar 2007

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 .
  • Kleijn , H. C. M. and Rozenberg , G. 1983 . Multi Grammars . International Journal of Computer Mathematics , 12 : 177 – 201 .
  • Meduna , A. in press . Four-Nonterminal Scattered Context Grammars Characterize the Family of Recursively Enumerable Languages . International Journal of Computer Mathematics ,
  • Paun , Gh. 1984 . Six Nonterminals are Enough for Generating each R. E. Language by a Matrix Grammar . International Journal of Computer Mathematics , 15 : 23 – 37 .

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.