3.5. Equivalence of regular expression and finite automata Questions & Answers | Discrete Structure BEI | TU | TABFlux