Deciding DFA primality is NP-hard, established by reduction from propositional satisfiability using a characterization of primality for a relevant class of automata.
de Roever, Hans Langmaack, and Amir Pnueli, editors
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
-
Deciding DFA-Primality is NP-Hard
Deciding DFA primality is NP-hard, established by reduction from propositional satisfiability using a characterization of primality for a relevant class of automata.