So as learned every DFA is an NFA. I feel like I understand DFA much better than NFA, so I try to convert my regular expressions to DFA, but I want to understand both sides.For example a|b (a Union b):However, are we losing anything if we eliminate the epsilon from these expressions, every DFA is an NFA right so what are we losing if we don't include it?
Why do we need epsilon-transitions in Thompson's construction?
regular languages;finite automata;regular expressions;simulation