New randomized reductions and faster algorithms for XNFA decision problems under polynomial or bounded ambiguity, extending to other semirings.
On the degree of ambiguity of finite automata
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.FL 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
Introduces MFN selective memoization based on minimum feedback vertex set for linear-time backtracking regex matching and relates it to prior schemes under Thompson and Glushkov automata constructions.
citing papers explorer
-
Algorithms and fine-grained complexity for nondeterministic and symmetric difference automata
New randomized reductions and faster algorithms for XNFA decision problems under polynomial or bounded ambiguity, extending to other semirings.
-
Selective Memoization for Efficient Backtracking Regular Expression Matching
Introduces MFN selective memoization based on minimum feedback vertex set for linear-time backtracking regex matching and relates it to prior schemes under Thompson and Glushkov automata constructions.