engineering recuitment GATE CSE 2023-24 Test Series Theory of Computation Regular Languages and Finite Automata Finite Automata
Consider the DFAs x and y given below.
Which of the following is/are true about the language L(m) = L(x) ∪ L(y)?
The finite automata will contain minimum states.
1
number of states in DFA is 2
2
Number of states in NFA is 1
3
number of states in ϵ-NFA is 1
4
Number of states in NFA is 2