3.2. Equivalence of Regular Expression and Finite Automata Notes | Theory of Computation BSC-CSIT | TU | TABFlux