The number of states in DFA that accepts the language L(M) ∩ L(N) i – McqOptions

MCQOPTIONS

1.	The number of states in DFA that accepts the language L(M) ∩ L(N) is _________
A.	0
B.	1
C.	2
D.	3
Answer» C. 2

Discussion

No Comment Found

Related MCQs

Which of the following pairs of regular expression are equivalent?
Which of the following is not regular?
The reorganizing capability of NDFA and DFA is?
Which of the following languages is/are regular?
Consider alphabet ∑ = {0, 1}, the null/empty string λ and the sets of strings X0, X1 and X0. How are X1 and X2 are related? Which one of the following represents the strings in X0?
The number of states in DFA that accepts the language L(M) ∩ L(N) is _________
How many minimum states are required to find whether a string has odd number of 0’s or not?
What can be said about a regular language L over {a} whose minimal finite state automaton has two states?
Given an arbitrary non-deterministic finite automaton (NFA) with N states, the maximum number of states in an equivalent minimized DFA is at least?
L1 is accepted by the NFA, obtained by changing the accepting state of M to a non-accepting state and vice versa. Which of the following statements is true?