Consider the following 2 statements S₁: { 0²ⁿ | n ≥ 1 } is a regular language…
2001
Consider the following 2 statements
S₁: { 0²ⁿ | n ≥ 1 } is a regular language
S₂: { 0ᵐ 1ⁿ 0ᵐ⁺ⁿ | m ≥ 1 and n ≥ 1 } is a regular language
- A.
Only S₁ is correct
- B.
Only S₂ is correct
- C.
Both S₁ and S₂ are correct
- D.
None of S₁ and S₂ is correct
Attempted by 39 students.
Show answer & explanation
Correct answer: A
Statement S₁ represents strings of even length zeros, which can be described by the regular expression (00)+, confirming it is a regular language. Statement S₂ requires matching counts of leading zeros with trailing zeros plus ones, necessitating memory beyond finite states, so it is not regular. Thus, only statement S₁ holds true among the given options.
A video solution is available for this question — log in and enroll to watch it.