4.3.2. Equivalence of regular grammar and finite automata Visual Notes | Theory of Computation BSC-CSIT | TU | TABFlux