Question:medium

Which among the following cannot be accepted by a regular grammar?

Show Hint

The language \[ \{a^n b^n\} \] is the most famous example of a non-regular language.
Updated On: Jun 25, 2026
  • L is a set of numbers divisible by 2
  • L is a set of binary complement
  • L is a set of string with odd number of 0
  • L is a set of \(0^n1^n\)
Show Solution

The Correct Option is D

Solution and Explanation

Was this answer helpful?
0