Abstract
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.
Preview
Unable to display preview. Download preview PDF.
References
D. Angluin, Inference of reversible languages, J. ACM 29, 1982, 741–765.
J.D. Emerald, K.G. Subramanian and D.G. Thomas, Learning Code regular and Code linear languages, Proceedings of ICGI-96, Lecture Notes in Artificial In-telligence 1147, 1996, 211–221.
E.M. Gold, Language identification in the limit, Information and Control, 10, 447–474, 1967.
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.
E. Makinen, The grammatical inference problem for the Szilard languages of linear grammars, Information Processing Letters, 36, 203–206, 1990.
H.A. Maurer, A. Salomaa and D. Wood, Pure Grammars, Information and Control 44, 47–72, 1980.
H.A. Maurer, G. Rozenberg and E. Welzl, Using string languages to describe picture languages, Information and Control, 54, 155–185, 1992.
N. Nirmal, K. Krithivasan, Filamentous Systems with apical growth, Intern. J. Comp. Inf. Sci. 14, 1985, 235–242.
Y. Sakakibara, Learning context-free grammars from structural data in polynomial time, Theoretical Computer Science, 76(2): 223–242, 1990.
K.G. Subramanian, A note on regular-controlled apical growth filamentous systems,Intern. J.Comp.Inf.Sci.14, 1985, 235–242.
N. Tanida and T. Yokomori, Inductive Inference of Monogenic Pure Context-free languages, Lecture Notes in Artificial Intelligence, 872, Springer-Verlag, 1994, 560–573.
T. Yokomori, On Polynomial-Time Learnability in the Limit of Strictly Deterministic Automata, Machine Learning, 19, 153–179, 1995.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Emerald, J.D., Subramanian, K.G., Thomas, D.G. (1998). Learning a subclass of context-free languages. In: Honavar, V., Slutzki, G. (eds) Grammatical Inference. ICGI 1998. Lecture Notes in Computer Science, vol 1433. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0054078
Download citation
DOI: https://doi.org/10.1007/BFb0054078
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64776-8
Online ISBN: 978-3-540-68707-8
eBook Packages: Springer Book Archive