Deciding decomposability of ideal automata into intersections or unions is in NL, with a poly-time algorithm for ideal-preserving intersection decompositions.
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
Deciding decomposability of ideal automata into intersections or unions is in NL, with a poly-time algorithm for ideal-preserving intersection decompositions.