Regular expressions and regular languages
Theory of Computation · Engineering
Study notes
Regex (a|b)*abb matches strings ending in 'abb': 'abb' matches, 'aabb' matches, 'ababb' matches, 'aba' fails. Convert to NFA via Thompson's construction (each operator becomes small NFA fragments wired together), then to DFA by subset construction. Every regex compiles to an automaton: this is how grep works.