Skip to content

Author

Akimasa Morihata

We have 1 of 52 papers

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

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

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.