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