NASA Logo

NTRS

NTRS - NASA Technical Reports Server

Back to Results
Non-context-free grammars generating context-free languagesIf G is a grammar such that in each non-context-free rule of G, the right side contains a string of terminals longer than any terminal string appearing between two nonterminals in the left side, then the language generated by G is context free. Six previous results follow as corollaries of this theorem.
Document ID
19740041376
Acquisition Source
Legacy CDMS
Document Type
Reprint (Version printed in journal)
Authors
Baker, B. S.
(Harvard University Cambridge, Mass., United States)
Date Acquired
August 7, 2013
Publication Date
March 1, 1974
Publication Information
Publication: Information and Control
Volume: 24
Subject Category
Computers
Accession Number
74A24126
Funding Number(s)
CONTRACT_GRANT: NGR-22-007-176
CONTRACT_GRANT: NSF GJ-30409
Distribution Limits
Public
Copyright
Other

Available Downloads

There are no available downloads for this record.
No Preview Available