203 views

Please log in or register to answer this question.

Related questions

0 votes
0 votes
1 answer
1
admin asked May 4, 2019
264 views
Let $\Sigma = \{a,b\}.$ Give a $CFG$ generating the language of strings with twice as many $a’s$ as $b’s.$ Prove that your grammar is correct$.$
0 votes
0 votes
0 answers
2
admin asked May 4, 2019
339 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$.$