SAI extends the RPNI framework with a splitting operation to identify symbolic automata over monotonic algebras with predicates a <= x < b in the limit, with a proof of polynomial-size characteristic samples.
Title resolution pending
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
-
Passive Learning of Symbolic Automata over Monotonic Algebras
SAI extends the RPNI framework with a splitting operation to identify symbolic automata over monotonic algebras with predicates a <= x < b in the limit, with a proof of polynomial-size characteristic samples.