search
Log In
0 votes
38 views
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$.$
in Theory of Computation
edited by
38 views

Please log in or register to answer this question.

Related questions

0 votes
1 answer
1
36 views
Let $C$ be a context-free language and $R$ be a regular language$.$ Prove that the language $C\cap R$ is context-free. Let $A = \{w\mid w\in \{a, b, c\}^{*}$ $\text{and}$ $w$ $\text{contains equal numbers of}$ $a’s, b’s,$ $\text{and}$ $c’s\}.$ Use $\text{part (a)}$ to show that $A$ is not a CFL$.$
asked May 4, 2019 in Theory of Computation Lakshman Patel RJIT 36 views
0 votes
0 answers
2
0 votes
0 answers
4
34 views
Let $CFG$ $G$ be the following grammar$.$ $S\rightarrow aSb \mid bY \mid Y a$ $Y\rightarrow bY \mid aY \mid \epsilon$ Give a simple description of $L(G)$ in English$.$ Use that description to give a $CFG$ for $\overline{L(G)},$ the complement of $L(G).$
asked May 4, 2019 in Theory of Computation Lakshman Patel RJIT 34 views
...