For automata accepting ideal languages, decomposability into intersection or union of smaller automata is decidable in NL, with a poly-time algorithm for intersection decompositions that preserve the ideal property.
SinceA is deterministic,uw∈R(A,q )
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
-
Decomposition of Automata recognizing Ideals
For automata accepting ideal languages, decomposability into intersection or union of smaller automata is decidable in NL, with a poly-time algorithm for intersection decompositions that preserve the ideal property.