2 2 votes Given the following statements: $S_1: \text{ The grammars }S \rightarrow asb \mid bsa \mid ss \mid a \text{ and } S \rightarrow asb \mid bsa \mid a$ are not equivalent. $S_2: \text{ The grammars }S \rightarrow ss \mid sss \mid asb \mid bsa \mid \lambda \text{ and } S \rightarrow ss \mid asb \mid bsa \mid \lambda $ are equivalent. $S_1$ is correct and $S_2$ is not correct Both $S_1$ ad $S_2$ are correct $S_1$ is not correct and $S_2$ is correct Both $S_1$ ad $S_2$ are not correct Theory of Computation ugcnetcse-dec2013-paper3 theory-of-computation + – go_editor 2.9k views answer comment Share Follow Print 0 reply Please log in or register to add a comment.
2 2 votes Both are correct. S1: The grammars S→asb∣bsa∣ss∣a and S→asb∣bsa∣a are not equivalent b/c aa is not accepted by second. S2: second is also true. Prashant. answered Jul 27, 2016 Prashant. comment Share Follow 0 reply Please log in or register to add a comment.