Open In App

We use cookies to ensure you have the best browsing experience on our website. By using our site, you acknowledge that you have read and understood our Cookie Policy & Privacy Policy

UGC-NET | UGC NET CS 2015 Dec – III | Question 26

The context free grammar given by
S → XYX
X → aX|bX|λ
Y → bbb
generates the language which is defined by regular expression:

(A) (a + b)*bbb
(B) abbb(a + b)*
(C) (a + b)*(bbb)(a + b)*
(D) (a + b)(bbb)(a + b)*

Answer: (C)
Explanation: S → XYX
X → aX|bX|λ
i.e. (a + b)*
Y → bbb
S → (a + b)*(bbb)(a + b)*
So, option (C) is correct.
Quiz of this Question

Article Tags :
UGC-NET
Recommended Articles
1. UGC-NET | UGC NET CS 2015 Dec – III | Question 20
2. UGC-NET | UGC NET CS 2015 Dec – III | Question 1
3. UGC-NET | UGC NET CS 2015 Dec – III | Question 2
4. UGC-NET | UGC NET CS 2015 Dec – III | Question 49
5. UGC-NET | UGC NET CS 2015 Dec – III | Question 3
6. UGC-NET | UGC NET CS 2015 Dec – III | Question 4
7. UGC-NET | UGC NET CS 2015 Dec – III | Question 5
8. UGC-NET | UGC NET CS 2015 Dec – III | Question 6
9. UGC-NET | UGC NET CS 2015 Dec – III | Question 7
10. UGC-NET | UGC NET CS 2015 Dec – III | Question 8
11. UGC-NET | UGC NET CS 2015 Dec – III | Question 9
12. UGC-NET | UGC NET CS 2015 Dec – III | Question 10
13. UGC-NET | UGC NET CS 2015 Dec – III | Question 11
14. UGC-NET | UGC NET CS 2015 Dec – III | Question 12
15. UGC-NET | UGC NET CS 2015 Dec – III | Question 13
16. UGC-NET | UGC NET CS 2015 Dec – III | Question 14
17. UGC-NET | UGC NET CS 2015 Dec – III | Question 15
18. UGC-NET | UGC NET CS 2015 Dec – III | Question 16
19. UGC-NET | UGC NET CS 2015 Dec – III | Question 17
20. UGC-NET | UGC NET CS 2015 Dec – III | Question 18
21. UGC-NET | UGC NET CS 2015 Dec – III | Question 19
22. UGC-NET | UGC NET CS 2015 Dec – III | Question 21
23. UGC-NET | UGC NET CS 2015 Dec – III | Question 22
24. UGC-NET | UGC NET CS 2015 Dec – III | Question 23
25. UGC-NET | UGC NET CS 2015 Dec – III | Question 24