in Theory of Computation edited by
272 views
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$.$
in Theory of Computation edited by
by
272 views

1 Answer

0 votes
0 votes
number of a's=2*number of b's

S->aaSb | baSa| aSba | SS | ε

Related questions