edited by
755 views

1 Answer

Best answer
1 votes
1 votes

L= { w | na(w) = nb(w) +2} } where  na(w)= no of occurrence of 'a'  and  nb(w)= no of occurrence of 'b'

language will accept all the string where no of 'a' will be 2 more than the no of 'b'.

selected by

Related questions

0 votes
0 votes
0 answers
2
1 votes
1 votes
3 answers
3
1 votes
1 votes
1 answer
4
Mk Utkarsh asked Feb 26, 2018
347 views
Find the grammar for the following language$L = \left \{ w: \left | w \right | mod 3 \geq \left | w \right | mod 2 \right \}$