Multiple choice

Consider the following languages:

Which of these languages is/are regular?

  1. Only L1 and L2

  2. Only L2, L3 and L4

  3. Only L3 and L4

  4. Only L3
Reveal answer Fill a bubble to check yourself
C Correct answer
Explanation

L1 would be accepted by PDA, so can’t be regular. Similarly, L2 can’t be accepted by DFA, so it is not regular. L3 and L4 both require only finite number of zeroes. So, both are regular.

Keep practicing — related questions