Advanced search
Publication Cover
International Journal of Computer Mathematics Volume 26, 1988 - Issue 1
Submit an article Journal homepage
9
Views
1
CrossRef citations to date
0
Altmetric
Original Articles

Two complexity measures for context-free languages

Erkki Mä Kinen Department of Computer Science, University of Tampere, P.O. Box 607, Tampere, SF-33101, Finland
Pages 29-34 | Received 01 Sep 1987, Published online: 19 Mar 2007
 
Sample our Bioscience journals, sign in here to start your access, Latest two full volumes FREE to you for 14 days

Abstract

The strict inclusion between regular and context-free languages is studied by defining two complexity measures which are based on homomorphisms regulating context-free languages.

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.