论文信息 - Inferring Finite Transducers

Inferring Finite Transducers

We consider the inference problem for finite transducers using different kinds of samples (positive and negative samples, positive samples only, and structural samples). Given pairs of input and output words, our task is to infer the finite transducer consistent with the given pairs. We show that this problem can be solved in certain special cases by using known results on the inference problem for linear languages.

Erkki Mäkinen

[1] Alfred V. Aho,et al. The Theory of Parsing, Translation, and Compiling , 1972 .

[2] Arto Salomaa,et al. Formal languages , 1973, Computer science classics.

[3] Michael A. Harrison,et al. Introduction to formal language theory , 1978 .

[4] Erkki Mäkinen,et al. A Note on the Grammatical Inference Problem for Even Linear Languages , 1996, Fundam. Informaticae.

[5] Takeshi Koshiba,et al. Learning Deterministic even Linear Languages From Positive Examples , 1997, Theor. Comput. Sci..

[6] Jean Berstel,et al. Transductions and context-free languages , 1979, Teubner Studienbücher : Informatik.

[7] E. Mark Gold,et al. Language Identification in the Limit , 1967, Inf. Control..

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

[9] Carl H. Smith,et al. Inductive Inference: Theory and Methods , 1983, CSUR.

[10] Yasubumi Sakakibara,et al. Efficient Learning of Context-Free Grammars from Positive Structural Examples , 1992, Inf. Comput..

[11] Arnold L. Rosenberg,et al. A Machine Realization of the Linear Context-Free Languages , 1967, Inf. Control..

[12] Enrique Vidal,et al. Learning Subsequential Transducers for Pattern Recognition Interpretation Tasks , 1993, IEEE Trans. Pattern Anal. Mach. Intell..

[13] G. Nagaraja,et al. Learning a Subclass of Linear Languages from Positive Structural Information , 1998, ICGI.