Learning a subclass of context-free languages
- 94 Downloads
In this paper, Apical growth Pure context-free grammars (AGPCFG) which are a variation of the pure grammars of Maurer et al are introduced. These grammars allow rewriting of active symbols at the ends of a string simultaneously. They also provide a variation of another kind of grammars called filamentous systems with apical growth, which are motivated by biological considerations. The family of languages generated by AGPCFGs is a subclass of context-free languages. An algorithm for learning this language subclass, in the framework of identification in the limit from positive examples, is provided.
KeywordsRegular Language Positive Data Distinguished Marker Apical Growth Chain Code
Unable to display preview. Download preview PDF.
- 4.T. Koshiba, E. Makinen and Y. Takada, Inferring pure context-free languages from positive data, Technical Report A-1997-14, Department of Computer Science, University of Tampere, 1997.Google Scholar
- 8.N. Nirmal, K. Krithivasan, Filamentous Systems with apical growth, Intern. J. Comp. Inf. Sci. 14, 1985, 235–242.Google Scholar
- 11.N. Tanida and T. Yokomori, Inductive Inference of Monogenic Pure Context-free languages, Lecture Notes in Artificial Intelligence, 872, Springer-Verlag, 1994, 560–573.Google Scholar