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