Regular expressions as finite automata
Kay Lack · 28:50
Regular expressions are a small pattern language whose real engine is the finite automaton: a graph of states and transitions that consumes characters and accepts a string if an accepting state is active at the end. T...