Register

regular expression

605 views
1 1 vote

Consider alphabet ∑ = {0, 1}, the null/empty string λ and the sets of strings X0, X1 and X2 generated by the corresponding non-terminals of a regular grammar. X0, X1 and X2 are related as follows:

X
0 = 1 X1 X1 = 0 X1 + 1 X2 X2 = 0 X1 + {λ}

Which one of the following choices precisely represents the strings in X0?

A

10 (0* + (10)*)1

B

10 (0* + (10)*)*1

C

1(0* + 10)*1

D

10 (0 + 10)*1 + 110 (0 + 10)*1

1 Answer

Voting & Accepting an answer helps improve the community
← Previous · Computer science gat...Next → · finite automata
← Previous in category · regular expressionNext in category → · finite automata
Position:
Show:

Related questions

3 3 votes
2 2 answers
282
282 views
GO Classes asked Oct 23, 2025
282 views
GO Classes DPP | TOC|REGULAR EXPRESSION
Consider the following three regular expressions over the alphabet $\Sigma=\{0,1\}$ :$p=\left(1^* 01^* 0\right)^* 1^*$ $q=\left(0^* 10^* 1\right)^* 0^*$ $r=((0+1)(0+1))^*...
3 3 votes
1 1 answer
312
312 views
GO Classes asked Oct 23, 2025
312 views
GO Classes DPP | TOC|REGULAR EXPRESSION
Let $\mathrm{p}, \mathrm{q}$, and r be three regular expressions over the alphabet $\Sigma=\{a, b\}$.$p=a(a+b)^* b$ $q=(a+b)^* a b(a+b)^*$ $r=a a^* b b^*$Which of the fol...