Question 7903 – Digital-Logic-Design
May 27, 2024Question 1270 – Nielit Scientist-B CS 2016 march
May 27, 2024Question 1358 – Theory-of-Computation
Let r = a(a + b)*, s = aa*b and t = a*b be three regular expressions.
- Consider the following:
(i) L(s) ⊆ L(r) and L(s) ⊆ L(t)
(ii). L(r) ⊆ L(s) and L(s) ⊆ L(t)
Choose the correct answer from the code given below :
Code :
Correct Answer: A
Question 358 Explanation:
L(s) = {∊, a, b, ab, bb, aa, ba, aab, baa,aaab, aaab,……}
L(r) = { ab, aab, aaab, aaaab, ………… }
L(t) = { b, ab, aab, aaab, aaaab, ……… }
L(s) can generate every possible string over a, b but L(r) and L(t) can’t generate every possible string over a, b.
So L(s) ⊆ L(r) and L(t) ⊆ L(r).
L(r) can’t generate “b” but L(t) can’t.
So L(s) ⊆ L(t).
L(r) = { ab, aab, aaab, aaaab, ………… }
L(t) = { b, ab, aab, aaab, aaaab, ……… }
L(s) can generate every possible string over a, b but L(r) and L(t) can’t generate every possible string over a, b.
So L(s) ⊆ L(r) and L(t) ⊆ L(r).
L(r) can’t generate “b” but L(t) can’t.
So L(s) ⊆ L(t).
Only (i) is correct
Both (i) and (ii) are correct
Only (ii) is correct
Neither (i) nor (ii) is correct
Subscribe
Login
0 Comments