A grammatical inference for $C$-finite languages
Milan Drášil · Czech digital mathematics library · 1989
For any language L, any finite set of contexts C, and any positive integer / we con struct a linear grammar FG(L> C, 0 generating a language, whose ith fragment coincides with the ith fragment of the given language.If there exists some positive integer k such that for any / 2. k the grammars FG(L 9 C, /) and FG(L, C, k) coincide, then the grammar FG(L t C, k) generates the given language.A necessary and sufficient condition for this coincidence is given.