Advanced search
Publication Cover
International Journal of Computer Mathematics Volume 65, 1997 - Issue 3-4
Submit an article Journal homepage
17
Views
2
CrossRef citations to date
0
Altmetric
Original Articles

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

Alexander Meduna Computing Center, Technical University of Brno, Udolni 19, Brno, 60200, Czech Republic
Pages 179-189 | Received 20 Sep 1996, Published online: 19 Mar 2007
 
Sample our Mathematics & Statistics journals, sign in here to start your FREE access for 14 days

Abstract

The present paper investigates the descriptional complexity of multi-sequential grammars with respect to the number of nonterminals. This investigation demonstrates that the family of recursively enumerable languages is characterized by six-nonterminal multi-sequential grammars.

C. R. Categories:

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.

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.