1 votes 1 votes Show that the grammars $S \rightarrow aSb|bSa|SS|a$ and $S \rightarrow aSb|bSa|a$ are not equivalent. Theory of Computation peter-linz peter-linz-edition4 theory-of-computation grammar + – Naveen Kumar 3 asked Mar 19, 2019 Naveen Kumar 3 297 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
2 votes 2 votes 2nd grammar dose not give string like aa,aaa... So both are not equvalent. abhishekmehta4u answered Mar 19, 2019 abhishekmehta4u comment Share Follow See all 0 reply Please log in or register to add a comment.