Learning a Subclass of Context-Free Languages
作者： J. D. Emerald , K. G. Subramanian , D. G. Thomas
DOI: 10.1007/BFB0054078
关键词:
摘要: In this paper, Apical growth Pure context-free grammars (AGPCFG) which are a variation of the pure Maurer et al introduced. These allow rewriting active symbols at ends string simultaneously. They also provide another kind called filamentous systems with apical growth, motivated by biological considerations. The family languages generated AGPCFGs is subclass languages. An algorithm for learning language subclass, in framework identification limit from positive examples, provided.
springer.com
sci-hub.se 参考文章(11)
H.A. Maurer, G. Rozenberg, E. Welzl, Using string languages to describe picture languages Information & Computation. ,vol. 54, pp. 155- 185 ,(1982) , 10.1016/S0019-9958(82)80020-X
Yasubumi Sakakibara, Learning context-free grammars from structural data in polynomial time Theoretical Computer Science. ,vol. 76, pp. 223- 242 ,(1990) , 10.1016/0304-3975(90)90017-C
K. G. Subramanian, A note on regular-controlled apical-growth filamentous systems International Journal of Parallel Programming. ,vol. 14, pp. 235- 242 ,(1985) , 10.1007/BF00997022
Nalinakshi Nirmal, Kamala Krithivasan, Filamentous systems with apical growth International Journal of Computer Mathematics. ,vol. 12, pp. 203- 215 ,(1983) , 10.1080/00207168208803338
Dana Angluin, Inference of Reversible Languages Journal of the ACM. ,vol. 29, pp. 741- 765 ,(1982) , 10.1145/322326.322334
J. D. Emerald, K. G. Subramanian, D. G. Thomas, Learning code regular and code linear languages international colloquium on grammatical inference. pp. 211- 221 ,(1996) , 10.1007/BFB0033356
Erkki Mäkinen, Takeshi Koshiba, Yuji Takada, Inferring pure context-free languages from positive data Acta Cybernetica. ,vol. 14, pp. 469- 477 ,(2000)
Noriyuki Tanida, Takashi Yokomori, Inductive Inference of Monogenic Pure Context-free Languages algorithmic learning theory. pp. 560- 573 ,(1994) , 10.1007/3-540-58520-6_90
Takashi Yokomori, On Polynomial-Time Learnability in the Limit of Strictly Deterministic Automata Machine Learning. ,vol. 19, pp. 153- 179 ,(1995) , 10.1023/A:1022615325466
E Mark Gold, Language identification in the limit Information & Computation. ,vol. 10, pp. 447- 474 ,(1967) , 10.1016/S0019-9958(67)91165-5