2 citations · 2 across the 2 of their papers we have counts for
2 papers
cs.FL2022
A closer look at TDFA
Angelo Borsotti, Ulya Trafimovich
We present an algorithm for regular expression parsing and submatch extraction based on tagged deterministic finite automata. The algorithm works with different disambiguation poli…
cs.FL2019★ 2 cited
Tagged Deterministic Finite Automata with Lookahead
Ulya Trofimovich
This paper extends the work of Laurikari and Kuklewicz on tagged deterministic finite automata (TDFA) in the context of submatch extraction in regular expressions. The main goal of…