Inferring finite transducers

Journal of the Brazilian Computer Society

Mäkinen, Erkki¹  University of Tampere, Finland¹ 

关键词: Formal languages;    inductive inference;    finite transducers;    linear languages.;   

DOI  :  10.1590/S0104-65002003000200001

学科分类：农业科学（综合）

来源: Springer U K

【 摘 要 】

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.

【 授权许可】

Unknown