Question: Which of the following options is incorrect?
Options
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
Previous ||
Properties-Non Regular Languages more questions
Myphill Nerode does the following:
Precedence of regular expression in decreasing order is
Regular expression {0,1} is equivalent to
Regular expression ?* is equivalent to
Which of the following are related to tree automaton?
Consider following regular expression^ i) (a/b)* ii) (a*/b*)* iii) ((?/a)b*)*^....
Statement: If we take the union of two identical expression,....
The given regular language corresponds to which of the given....
The minimum length of a string {0,1}* not in the....
Ambiguous Grammar more Online Exam Quiz
Deterministic Finite Automata-Introduction and Definition
Finding Patterns in Text,Algebric Laws and Derivatives
From Grammars to Push Down Automata
Node-Cover Problem, Hamilton Circuit Problem
Problem Solvable in Polynomial Time
Regular Language & Expression - 1
Turing Machine-Notation and Transition Diagrams
Engine Components - Connecting Rod