Descriptional Complexity Of Generalized Forbidding Grammars: International Journal of Computer Mathematics: Vol 80, No 1

Views

CrossRef citations to date

Altmetric

This paper discusses the descriptional complexity of generalized forbidding grammars. It proves that every recursively enumerable language is generated by a generalized forbidding grammar containing no more than thirteen forbidding productions and no more than fifteen nonterminals.

Keywords:

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:

Order Reprints Request Corporate Permissions

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:

Request Academic Permissions

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.

Descriptional Complexity Of Generalized Forbidding Grammars

Information for

Open access

Opportunities

Help and information

Descriptional Complexity Of Generalized Forbidding Grammars

Reprints and Corporate Permissions

Academic Permissions

Related research

To cite this article:

Download citation

Information for

Open access

Opportunities

Help and information

Keep up to date

Your download is now in progress and you may close this window

Login or register to access this feature