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
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
citation-role summary
background 2
citation-polarity summary
years
2026 3verdicts
UNVERDICTED 3roles
background 2polarities
background 2representative citing papers
Timely generation is impossible for eventually consistent generators but achievable with vanishing hallucination rate for superlinear deadlines, and impossible for linear deadlines.
Banach density reveals topological dichotomies in language generation: 1/2 is always achievable in 1D for finite-rank spaces but impossible in some infinite-rank cases, unlike asymptotic density; d>=2 needs nondegeneracy.
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.
-
A Theory of Time-Sensitive Language Generation: Sparse Hallucination Beats Mode Collapse
Timely generation is impossible for eventually consistent generators but achievable with vanishing hallucination rate for superlinear deadlines, and impossible for linear deadlines.
-
Banach density of generated languages: Dichotomies in topology and dimension
Banach density reveals topological dichotomies in language generation: 1/2 is always achievable in 1D for finite-rank spaces but impossible in some infinite-rank cases, unlike asymptotic density; d>=2 needs nondegeneracy.