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

The complexity of the membership problem for some extensions of context-free languagestFootnote†

I. H. Sudborough Department of Computer Sciences, Northwestern University, Evanston, Illinois, 60201, U.S.A
Pages 191-215 | Received 01 Aug 1976, Published online: 19 Mar 2007

Citations (17)

Keep up to date with the latest research on this topic with citation updates for this article.

Subscribe to citation updates

Read on this site (1)

PeterR.J. Asveld. (1981) Time and space complexity of inside-out macro languages. International Journal of Computer Mathematics 10:1, pages 3-14.
Read now

Articles from other publishers (16)

ANDREAS KLEIN & MARTIN KUTRIB. (2011) CONTEXT-FREE GRAMMARS WITH LINKED NONTERMINALS. International Journal of Foundations of Computer Science 18:06, pages 1271-1282.
Crossref
Henning Fernau & Ralf Stiebe. (2002) Sequential grammars and automata with valences. Theoretical Computer Science 276:1-2, pages 377-405.
Crossref
Henning Fernau & Ralf Stiebe. 1997. Mathematical Foundations of Computer Science 1997. Mathematical Foundations of Computer Science 1997 239 248 .
Owen Rambow & Giorgio Satta. 1994. Current Issues in Mathematical Linguistics. Current Issues in Mathematical Linguistics 121 130 .
K.-J. Lange. (1993) Complexity and structure in formal language theory. Complexity and structure in formal language theory.
David J. Weir. (1992) A geometric hierarchy beyond context-free languages. Theoretical Computer Science 104:2, pages 235-261.
Crossref
H. Venkateswaran. (1991) Properties that characterize LOGCFL. Journal of Computer and System Sciences 43:2, pages 380-404.
Crossref
Dung T. Huynh. (1991) The effective entropies of some extensions of context-free languages. Information Processing Letters 37:3, pages 165-169.
Crossref
Klaus-Jörn Lange. 1989. Machines, Languages, and Complexity. Machines, Languages, and Complexity 19 36 .
Joost Engelfriet. (1986) The Complexity of Languages Generated by Attribute Grammars. SIAM Journal on Computing 15:1, pages 70-86.
Crossref
G. Rozenberg & A. SalomaaKlaus-Jörn Lange. 1986. The Book of L. The Book of L 245 252 .
J. Gonczarowski & E. Shamir. (1985) Pattern selector grammars and several parsing algorithms in the context-free style. Journal of Computer and System Sciences 30:3, pages 249-273.
Crossref
Klaus & Jörn Lange. 1984. Mathematical Foundations of Computer Science 1984. Mathematical Foundations of Computer Science 1984 378 388 .
Klaus -Jörn Lange. 1983. Automata, Languages and Programming. Automata, Languages and Programming 723 733 .
Walter L. Ruzzo. (1981) On uniform circuit complexity. Journal of Computer and System Sciences 22:3, pages 365-383.
Crossref
Walter L. Ruzzo. (1980) Tree-size bounded alternation. Journal of Computer and System Sciences 21:2, pages 218-235.
Crossref

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.