Formal grammar characterization of k-storable languages

Construct a natural formal grammar that characterizes the languages in $kSNA_{FBS}$ for each positive integer $k$.

Background

The paper develops algebraic characterizations for bounded kk-storable languages through generalized Ginsburg stratified semi-linearity, but it does not provide a formal grammar model for the full class kSNAFBSkSNA_{FBS}. The authors identify the absence of such a characterization as an unresolved question and seek a grammar that captures these languages naturally.

References

Every language in $kSNA_{FBS}$ so far lacks a formal grammar characterization. What is a most natural grammar that characterizes such a language?

— Semi-Linearity and Generalized Stratified Semi-Linearity beyond Context-Free Languages  (2610.19562 - Yamakami, 14 Oct 2026) in Section 8, “Brief Discussion and Open Problems”