Which of the following options is incorrect?

Question

TuteeHUB · Accepted Answer

NA

TuteeHUB · Answer

A language L is regular if and only if ~L has finite number of equivalent classes

TuteeHUB · Answer

Let L be a regular language. If ~L has k equivalent classes, then any DFA that recognizes L must have atmost k states

TuteeHUB · Answer

A language L is NFA-regular if and only if it is DFA-regular

TuteeHUB · Answer

None of the mentioned

1.	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
Answer» C.

Discussion