in Theory of Computation edited by
422 views
2 votes
2 votes
Please write grammar for it and explain with example.

$L=\{w \: : n_a(w) > n_b(w) \}$
in Theory of Computation edited by
422 views

1 Answer

1 vote
1 vote
S -> ASb | bSA | SS | a  
A-> aA | a
edited by
by

1 comment

is '$\epsilon$' present in language ?
1
1

Related questions

0 votes
0 votes
2 answers
3