Skip to main content


eCommons@Cornell

eCommons@Cornell >
College of Engineering >
Computer Science >
Computer Science Technical Reports >

Please use this identifier to cite or link to this item: http://hdl.handle.net/1813/5872
Title: On the Equivalence and Containment Problems for Context-Free Languages
Authors: Hopcroft, John E.
Keywords: computer science
technical report
Issue Date: Jun-1968
Publisher: Cornell University
Citation: http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR68-19
Abstract: Let $G$ and $G_{0}$ be context-free grammars. Necessary and sufficient conditions on $G_{0}$ are obtained for the decidability of $L(G_{0}) \subseteq L(G)$. It is also shown that it is undecidable for which $G_{0},L(G) \subseteq L($G_{0})$ is decidable. Furthermore, given that $L(G) \subseteq L($G_{0})$ is decidable for a fixed $G_{0}$, there is no effective procedure to determine the algorithm which decides $L(G) \subseteq L($G_{0})$. If $L(G_{0})$ is a regular set, $L(G)=L(G_{0})$ is decidable if and only if $L(G_{0})$ is bounded. However, there exist non-regular, unbounded $L(G_{0})$ for which $L(G) = L(G_{0})$ is decidable.
URI: http://hdl.handle.net/1813/5872
Appears in Collections:Computer Science Technical Reports

Files in This Item:

File Description SizeFormat
68-19.pdf451.79 kBAdobe PDFView/Open
68-19.ps198.81 kBPostscriptView/Open

Refworks Export

Items in eCommons are protected by copyright, with all rights reserved, unless otherwise indicated.

 

© 2014 Cornell University Library Contact Us