1 votes 1 votes Which of the following grammars are equivalent?S is non terminal ,e is epsilon,a is terminal 1. S-> aS |e 2. S-> aS | a |e 3. S-> aaS |e Theory of Computation theory-of-computation regular-grammar + – rahul sharma 5 asked Aug 6, 2017 rahul sharma 5 1.2k views answer comment Share Follow See 1 comment See all 1 1 comment reply joshi_nitish commented Aug 6, 2017 reply Follow Share L1=a* L2=a* L3=(aa)* hence L1 and L2 are equivalent. 1 votes 1 votes Please log in or register to add a comment.
1 votes 1 votes In the given grammars 1st and 2nd grammar are equivalent 1-This grammar can generate following strings {ϵ,a,aa,aaa,....} 2-This grammar generates similar string as 1st one { ϵ,a,aa,aaa,....} 3-Difference with this grammar is it can't generate single a and can only generate string with even number of a's saurabh_dan answered Aug 6, 2017 saurabh_dan comment Share Follow See all 0 reply Please log in or register to add a comment.