search
Log In
2 votes
207 views
Please write grammar for it and explain with example.

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

1 Answer

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

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

Related questions

1 vote
1 answer
1
193 views
Please solve this question with proper explanation: $L=\{ w : \: n_a(w) = 2n_b(w) \}$
asked Jul 8, 2016 in Theory of Computation Lakshya Mission 1 193 views
0 votes
1 answer
2
0 votes
0 answers
3
0 votes
1 answer
4
...