Let A be a NFA with epsilon transitions such that there are no transitions into q0 (start state) and no transitions out of qf (the accepting state). Let L be the language recognized by A. The above automata ‘A’ is modified by adding an epsilon-transition from Qf to Q0. The language accepted by the modified ‘A’ in terms of ‘L’ will be :
-
Same as L
-
Accepts null
-
Accepts universal language
- Accept L+