Preprint
Aug 2026
Translation of Regular Expression with Lookahead into Finite State Automaton
W weighted regular expressions are considered, which enable us to calculate submatch addressing and a transformation from a weighted REwLA of size $m$ to a weighted nondeterministic finite automaton of $\mr{O}(2^{2^m})$ states is proposed.
Akimasa Morihata
· 2 citations