Which Of The Following Options Is Incorrect #320
Which of the following options is incorrect?
This multiple choice question (MCQ) is related to the book/course
gs gs101 Automata Theory.
It can also be found in
gs gs101 Regular Expressions and Languages - Properties-Non Regular Languages - Quiz No.1.
Which of the following options is incorrect?
A language L is regular if and only if ~L has finite number of equivalent classes
Let L be a regular language. If ~L has k equivalent classes, then any DFA that recognizes L must have atmost k states
A language L is NFA-regular if and only if it is DFA-regular
None of the mentioned
Similar question(s) are as followings:
Online Quizzes of gs101 Automata Theory
Other Classes Of Problems - Randomized Algorithm - Quiz No.1
gs gs101 Automata Theory
Online Quizzes
Push Down Automata - DPDA and Ambiguous Grammars - Quiz No.1
gs gs101 Automata Theory
Online Quizzes
