A note on the inclusion problem for szilard languages † : International Journal of Computer Mathematics: Vol 21, No 3-4

Views

CrossRef citations to date

Altmetric

Abstract

It is shown that the problem of labeling the productions of two regular grammars G ₁ and G ₂ in such a way that the Szilard language of G ₁ is included in the Szilard language of G ₂ is NP-complete.

Keywords:

C.R. Categories:

F.4.2

^†This work was supported by the Academy of Finland.

Notes

^†This work was supported by the Academy of Finland.

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.

A note on the inclusion problem for szilard languagesFootnote^†
^†This work was supported by the Academy of Finland.

Information for

Open access

Opportunities

Help and information

A note on the inclusion problem for szilard languagesFootnote††This work was supported by the Academy of Finland.

Abstract

Notes

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

A note on the inclusion problem for szilard languagesFootnote^†
^†This work was supported by the Academy of Finland.