论文信息 - The Grammatical Inference Problem for the Szilard Languages of Linear Grammars

The Grammatical Inference Problem for the Szilard Languages of Linear Grammars

We show that the inference problem related with the structure of linear grammars can be solved by a conceptually simple algorithm in linear time. Our approach makes it possible to reduce the problem of inferring the structure of a context-free grammar back to the normal grammatical inference problem.

Erkki Mäkinen

[1] Takashi Yokomori. Learning Context-Free Languages Efficiently - A Report on Recent Results in Japan , 1989, AII.

[2] Etsuro Moriya,et al. Associate Languages and Derivational Complexity of Formal Grammars and Languages , 1973, Inf. Control..

[3] Erkki Mäkinen,et al. On context-free derivations , 1985 .

[4] Jan van Leeuwen,et al. Worst-case Analysis of Set Union Algorithms , 1984, JACM.

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

[6] Yuji Takada. Grammatical Interface for Even Linear Languages Based on Control Sets , 1988, Inf. Process. Lett..

[7] Yasubumi Sakakibara,et al. Learning context-free grammars from structural data in polynomial time , 1988, COLT '88.

[8] Dana Angluin,et al. Inference of Reversible Languages , 1982, JACM.

[9] Robert E. Tarjan,et al. A linear-time algorithm for a special case of disjoint set union , 1983, J. Comput. Syst. Sci..