Which of the following is/are TRUE?
1
If an NFA N1 = { Q1 , ∑ , δ1 , q0 , F1 } and its equivalent DFA N2 = { Q2 , ∑ , δ2 , q0 , F2 } , then Q2 ⊆ Q1 and F2 ⊆ Q1
2
Corresponding to every NFA there is an equivalent Right linear grammar
3
L is regular iff there exist a NFA without any dead configuration which accepts L
4
If L is set of all strings ending with atleast n b’s then minimum no. of states in NFA that accept L is n+2 .