Consider the following two languages: L₁ = { aⁿ bˡ aᵏ | n + l + k > 5 } L₂ = {…
2013
Consider the following two languages:
L₁ = { aⁿ bˡ aᵏ | n + l + k > 5 }
L₂ = { aⁿ bˡ aᵏ | n > 5, l > 3, k ≤ l }
Which of the following is true?
- A.
L₁ is regular language and L₂ is not regular language
- B.
Both L₁ and L₂ are regular languages
- C.
Both L₁ and L₂ are not regular languages
- D.
L₁ is not regular language and L₂ is regular language
Attempted by 24 students.
Show answer & explanation
Correct answer: A
L₁ is regular because the condition n + l + k > 5 restricts only the total length, which a finite automaton can check.
L₂ is not regular because k ≤ l requires comparing counts of different symbols, exceeding finite memory.
A video solution is available for this question — log in and enroll to watch it.