0 votes 0 votes Let $A/B = \{w\mid wx\in A$ $\text{for some}$ $x \in B\}.$ Show that if $A$ is context free and $B$ is regular$,$ then $A/B$ is context free$.$ Theory of Computation michael-sipser theory-of-computation context-free-language regular-language + – admin asked May 4, 2019 edited May 4, 2019 by Lakshman Bhaiya admin 339 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.