927 views
0 0 votes

Question : (Here e=epsilon) S->A|B, A->e, B->aBb, B->b

My answer is :

S->B, B->aBb , B->b

  or

S->B|e , B->aBb , B->b

Want to know which one is correct ? please explain...

1 Answer

Best answer
6 6 votes
second one is correct , if S---> e we could not eliminate it bcoz language generate e ,and if language does not generate e then it can be eliminate ...

s-->AB

A--->aAA/e

B--->bBB/e after elimination of e

S-->AB/A/B/e

A-->aAA/aA/a

B-->bBB/bB/b
• selected by
Position:
Show:

Related questions

1 1 vote
1 1 answer
83
83 views
GO Classes asked Sep 9
83 views
Suppose a PDA has the transition rules $\delta(q_1,a,c)=\{(q_3,c)\}$ and $\delta(q_1,\epsilon,c)=\{(q_1,c)\}$. From the current configuration $(q_1,acbc,c\#Z)$, where the...
2 2 votes
1 1 answer
207
207 views
GO Classes asked Jul 10
207 views
What is $\epsilon$-closure of $q_1$ in the given $\epsilon$-NFA?$\{q_0\}$ $\{q_0,q_1,q_2\}$ $\{q_0,q_2\}$ $\{q_0,q_1\}$
1 1 vote
1 1 answer
1.5k
1.5k views
Xylene asked Jul 15, 2017
1,514 views
From rice theorem, I know that it is not recursive. But can someone prove that ? Or atleast give some intuitive proof?
0 0 votes
0 0 answers
1.6k
1.6k views