231 views
2 votes
2 votes

Consider alphabet Σ = {ab}, the null/empty string λ and the set of strings X0X1X2 and X3 generated by the corresponding non-terminals of a regular grammar X0X1X2, and X3 are related as follows:

Which one of the following choice precisely represents the string in X1 ∪ X2?

A     b*a b*a b*a b*

B     (a + b)*

C   ba (a + b)*

D    b*a ba b*

answer given is c but how becz c is representing x0........please check

Please log in or register to answer this question.

No related questions found