2.6. Equivalence of regular expression and finite automata Questions & Answers | Theory of Computation BCT-NEW | TU | TABFlux