Which of the following options is incorrect?
Posted: Thu Jul 14, 2022 9:24 am
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
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