NFA-εs are defined because certain properties can be more easily proved on them as compared to NFA.
(a) True
(b) False
This question was addressed to me by my school teacher while I was bunking the class.
Question is from The NFA with epsilon in chapter Finite Automata and Regular Expression of Compiler