0 votes 0 votes For any language $A,$ let $SUFFIX(A) = \{v\mid uv \in A$ $\text{for some string u\}}.$ Show that the class of context-free languages is closed under the $\text{SUFFIX operation.}$ Theory of Computation michael-sipser theory-of-computation context-free-language suffix-operation proof + – admin asked May 4, 2019 edited May 4, 2019 by Lakshman Bhaiya admin 371 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.