Computer Sciences > GATE 2015 SET-1 > Automata
Consider the DFAs M and N given above. The number of states in a minimal DFA that accepts the language L(M) ∩ L(N) is _______.

Correct : 1

Similar Questions

Which of the following is/are undecidable?
#310 MSQ
Consider the 5-state DFA M accepting the language L(M) ⊂ (0 + 1)* shown below. For any string w ∈ (0 + 1)* let n0(w) be the number of 0′s in w and n1(w) be the...
#886 MSQ
Which one of the following regular expressions is equivalent to the language accepted by the DFA given below?
#910 MCQ

Related Topics

No tags found

Unique Visitor Count

Total Unique Visitors

Loading......

Question Options

Contributed by: