L1 W W Does Not Contain The String Tr Br L2 W W Does Contain #152

L1= {w | w does not contain the string tr }<br /> L2= {w | w does contain the string tr}<br /> Given ∑= {t, r}, The difference of the minimum number of states required to form L1 and L2?

This multiple choice question (MCQ) is related to the book/course gs gs101 Automata Theory. It can also be found in gs gs101 Finite Automata - Applications of NFA - Quiz No.1.