automaton_primality (221B)
1 # Automaton primality 2 3 decide if an input DFA can be written as the [automaton_intersection] of input DFAs that all have strictly less states 4 5 it in [NP_hard] to decide, see [spenner2026deciding] 6 7 Up: [automata_problems]