ε-NFA

Home > Languages > Formal Language > Finite Automata > ε-NFA

It is a type of NFA which allows epsilon transitions. These transitions occur without reading any input, and they change the state of the automata without any input symbol.