Combining Regular Expressions with Near-Optimal Automata in the FIRE Station Environment
Bruce W. Watson, Michiel Frishert, Loek · 2005
We discuss a method for efficiently computing deterministic Brzozowski (derivatives) automata. Our approach is based on efficiently storing regular expressions using parse trees and expressions using common subexpression elimination.