pith. sign in

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 1

years

2026 1

verdicts

UNVERDICTED 1

clear filters

representative citing papers

Decomposition of Automata recognizing Ideals

cs.FL · 2026-04-28 · unverdicted · novelty 6.0

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.

citing papers explorer

Showing 1 of 1 citing paper after filters.

  • Decomposition of Automata recognizing Ideals cs.FL · 2026-04-28 · unverdicted · none · ref 2

    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.