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
Which of the following options is incorrect?
-
answerhappygod
- Site Admin
- Posts: 899604
- Joined: Mon Aug 02, 2021 8:13 am
Which of the following options is incorrect?
Join a community of subject matter experts. Register for FREE to view solutions, replies, and use search function. Request answer by replying!