2 votes 2 votes Please write grammar for it and explain with example. $L=\{w \: : n_a(w) > n_b(w) \}$ Theory of Computation grammar theory-of-computation + – Lakshya Mission 1 asked Jul 8, 2016 edited Sep 28, 2016 by go_editor Lakshya Mission 1 420 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
1 votes 1 votes S -> ASb | bSA | SS | a A-> aA | a VS answered Mar 4, 2018 edited Mar 5, 2018 by Prashant. VS comment Share Follow See 1 comment See all 1 1 comment reply joshi_nitish commented Mar 4, 2018 reply Follow Share is '$\epsilon$' present in language ? 1 votes 1 votes Please log in or register to add a comment.