Register

Toc Gate 2018 sample practice

1,640 views
0 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

Voting & Accepting an answer helps improve the community
← Previous · Self Doubt on order ...Next → · Inherently Ambiguous...
← Previous in category · MadeEasy Subject Tes...Next in category → · Inherently Ambiguous...
Position:
Show:

Related questions

7 7 votes
4 4 answers
4.6k
4.6k views
Pranav Madhani asked Nov 19, 2017
4,587 views
TOC SAMPLE PRACTICE
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 t...
1 1 vote
2 answers 2 answers
3.3k
3.3k views
Pranav Madhani asked Nov 18, 2017
3,281 views
TOC SAMPLE PRACTICE
Consider the language defined by the regular expression (a | b) * b+.Which of the following regular expressions also define that language?(i) (a*b+) | (b*b+)(ii) (ab |bb)...
0 0 votes
1 answers 1 answer
1.2k
1.2k views
Pranav Madhani asked Nov 17, 2017
1,213 views
Sample Practice
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 f...
1 1 vote
2 2 answers
4.0k
4.0k views
Pranav Madhani asked Nov 16, 2017
3,976 views
TOC Sample Practice
Choose the correct statement for the following regular expression over the symbols 0 & 1.0(0+1)*0 + 1(0+1)*1(a) To represent all strings over 0’s and 1’s(b) To represent ...