The Gateway to Computer Science Excellence
+2 votes
159 views
Please write grammar for it and explain with example.

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

1 Answer

+1 vote
S -> ASb | bSA | SS | a  
A-> aA | a
by Boss (10.8k points)
edited by
+1
is '$\epsilon$' present in language ?
Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,737 questions
57,312 answers
198,342 comments
105,034 users