Bounded-fan-out linear MCFGs under fixed explicit monoid typing are identifiable in the limit from positive data via sentence-interface typed refinements and a polynomial-time learner.
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
-
Finite Sentence-Interface Control for Learning Bounded-Fan-Out Linear MCFGs under Fixed Monoid Typing
Bounded-fan-out linear MCFGs under fixed explicit monoid typing are identifiable in the limit from positive data via sentence-interface typed refinements and a polynomial-time learner.