Computer Sciences > Gate 2016 Set-2 > DFA
Consider the following two statements:
I. If all states of an NFA are accepting states then the language accepted by the NFA is Σ* .
II. There exists a regular language A such that for all languages B, A ∩ B is regular.
Which one of the following is CORRECT?
I. If all states of an NFA are accepting states then the language accepted by the NFA is Σ* .
II. There exists a regular language A such that for all languages B, A ∩ B is regular.
Which one of the following is CORRECT?
Correct : DFA
PROCESSED
Similar Questions
The number of states in the minimum sized DFA that accepts the language defined by the regular expression
(0+1)*(0+1)(0+1)*
is __________________
The minimum possible number of states of a deterministic finite automaton that accepts a regular language L = {w1aw2 | w1, w2 ∈{a,b}* , |w1| = 2, w2>=3} is__...
Consider the following language.
L = { x∈{a,b}* ∣ number of a’s in x divisible by 2 but not divisible by 3 }
The minimum number of states in DFA that accepts...
Total Unique Visitors
Loading......