3.5. Equivalence of regular expression and finite automata Notes | Discrete Structure BEI | TU | TABFlux