Which of the following options is incorrect?
A
A language L is regular if and only if ~L has finite number of equivalent classes
B
Let L be a regular language. If ~L has k equivalent classes, then any DFA that recognizes L must have atmost k states
C
A language L is NFA-regular if and only if it is DFA-regular
D
None of the mentioned
Correct Answer: Let L be a regular language. If ~L has k equivalent classes, then any DFA that recognizes L must have atmost k states
Let L be a regular language. If ~L has k equivalent classes, then any DFA that recognizes L must have atleast k states.