Researchregular expressionsfinite automatatheory
Author Implements Regular Expressions And Constructs Automata
|
3.9
This essay develops a constructive implementation of formal regular expressions and demonstrates classical results in automata theory, including conversion to epsilon-free finite-state recognizers, determinization, and closure under union, concatenation, and Kleene star. It also previews a Part II showing that any language recognized by a finite-state automaton is regular, and surveys regex extensions like +, ?, intersection, difference, and complement.
Scoring Rationale
Clear constructive exposition of classical automata results, but lacks novel research contributions or new empirical evidence.
Practice interview problems based on real data
1,500+ SQL & Python problems across 15 industry datasets — the exact type of data you work with.
Try 250 free problems
