New constructions intersect k NFAs in O(m n^{k-1}) transitions for fixed alphabet, enabling faster emptiness algorithms that are optimal unless (k+1)-clique detection admits a combinatorial breakthrough.
Transition complexity of language operations
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.FL 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Intersecting Dense Automata
New constructions intersect k NFAs in O(m n^{k-1}) transitions for fixed alphabet, enabling faster emptiness algorithms that are optimal unless (k+1)-clique detection admits a combinatorial breakthrough.