Limits of Pure Grammars with Monotone Productions
Pavel Martinek · Fundamenta Informaticae · 1998
The grammatical inference problem is solved for a class of languages which can be generated by pure grammars with non-shortening productions. Necessary and sufficient condition for determination whether a language belongs to this class is formulated