1,039 views
0 votes
0 votes
Consider 2 regular expression:
i. ϕ* + a+ + b+ + (a + b)+ → r1
ii. ϕ+ + a* + b* + (a + b)* → r2

(a) L(r1) = L(r2) (b) L(r1) ⊆ L(r2)
(c) L(r1) ⊇ L(r2) (d) None of above
Solution: Option (a)

 

how need explanation? wont answer be c?

1 Answer

2 votes
2 votes

....

Related questions

7 votes
7 votes
4 answers
1
Pranav Madhani asked Nov 19, 2017
3,443 views
Determine the minimum height of parse tree in CNF for terminal string of length w, which is constructed by using CFG G(a) log2|w|+1 (b) log2|w|(c) log2|w|−1 (d) None of...
0 votes
0 votes
1 answer
3
Pranav Madhani asked Nov 17, 2017
854 views
Consider this grammar:S → SS | aHow many derivation trees are possible for a4?(a) 3 (b) 4(c) 5 (d) 6 how to generalize for any values if a^5 or a^7 is there any general...