0 votes 0 votes 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$.$ Theory of Computation michael-sipser theory-of-computation context-free-grammar context-free-language + – admin asked May 4, 2019 • edited May 4, 2019 by Lakshman Bhaiya admin 267 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes number of a's=2*number of b's S->aaSb | baSa| aSba | SS | ε aditi19 answered Aug 14, 2019 aditi19 comment Share Follow See all 0 reply Please log in or register to add a comment.