260 views
0 votes
0 votes
Are the following two grammers equivalent?

G1 :-S-> aS | e

G2: S-> aaS | e

I was reading this question somewhere and it was written that second one is sentential form of first and they are equal,but i dont think so.Second one will generate only even a's but first one is generating every combination of a.Please help

Please log in or register to answer this question.

Related questions

1 votes
1 votes
1 answer
1
akhileshreddy asked Jul 12, 2017
560 views
L = {a^nb^m : n >= m+3}below context grammer is correct??S == aA | AaA == aAb | bAa | abA | baA | aa
1 votes
1 votes
1 answer
3
rahul sharma 5 asked Aug 6, 2017
1,235 views
Which of the following grammars are equivalent?S is non terminal ,e is epsilon,a is terminal1. S- aS |e2. S- aS | a |e3. S- aaS |e
7 votes
7 votes
2 answers
4
resuscitate asked Dec 5, 2015
12,035 views
The number of equivalence classes which exist for the following regular expression R are ______. $R=(a+b)^*b(a+b+\epsilon )$ what is the meaning of equivale...