Postfix automata
We proposed a compact method named postfix automata to construct smaller NFAs. Our method is based on the coded syntax tree of the postfix regular expression. Our work can be used to optimize the regular expression utilization.
regular expression finite automata follow automata thompson's automata