Register set automata enable deterministic linear-time matching for a class of regexes with single-letter backreferences over finite alphabets via derivative-based transformations from register automata.
We will show that ρ′ is accepting, and sow ∈ L(A′)
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LO 1years
2022 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Towards Efficient Matching of Regexes with Backreferences using Register Set Automata (Technical Report)
Register set automata enable deterministic linear-time matching for a class of regexes with single-letter backreferences over finite alphabets via derivative-based transformations from register automata.