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