Theory-of-Computation
December 6, 2023Question 9743 – Theory-of-Computation
December 6, 2023GATE 2001
|
Question 4
|
Consider the following two statements:
- S1: {02n|n≥1|} is a regular language
S2: {0m1n0m+n|m≥1 and n≥1|} is a regular language
Which of the following statements is correct?
|
Only S1 is correct
|
|
|
Only S2 is correct
|
|
|
Both S1 and S2 are correct
|
|
|
None of S1 and S2 is correct
|
Question 4 Explanation:
For S1 we can construct DFA. S1 represents the string contains even no. of 0’s. So S1 is regular.
For S2, DFA is not possible which is not regular.
For S2, DFA is not possible which is not regular.
Correct Answer: A
Question 4 Explanation:
For S1 we can construct DFA. S1 represents the string contains even no. of 0’s. So S1 is regular.
For S2, DFA is not possible which is not regular.
For S2, DFA is not possible which is not regular.