0 votes 0 votes Read the definitions of NOPREFIX(A) and NOEXTEND(A) in Question $1.40$. Show that the class of CFLs is not closed under NOPREFIX. Show that the class of CFLs is not closed under NOEXTEND. Theory of Computation michael-sipser theory-of-computation context-free-language + – admin asked Oct 12, 2019 • edited Oct 12, 2019 by Lakshman Bhaiya admin 258 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.