MCQ
Q.
Which among the following cannot be accepted by a regular grammar?
Correct Answer: D
There exists no finite automata to accept the given language i.e. 0n1n. For other options, it is possible to make a dfa or nfa representing the language set.
