论文信息 - Learning context-free grammars from structural data in polynomial time - 字舞流文

Learning context-free grammars from structural data in polynomial time

Yasubumi Sakakibara | Y. Sakakibara

[1] Dana Angluin,et al. Learning Regular Sets from Queries and Counterexamples , 1987, Inf. Comput..

[2] Piotr Berman,et al. Learning one-counter languages in polynomial time , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[3] Leona F. Fass,et al. Learning context-free languages from their structured sentences , 1983, SIGA.

[4] Aravind K. Joshi,et al. Skeletal Structural Descriptions , 1978, Inf. Control..

[5] E. Mark Gold,et al. Complexity of Automaton Identification from Given Data , 1978, Inf. Control..

[6] Stefano Crespi-Reghizzi,et al. The use of grammatical inference for designing programming languages , 1973, Commun. ACM.

[7] Walter S. Brainerd,et al. The Minimalization of Tree Automata , 1968, Inf. Control..