Algorithms for Learning Function Distinguishable Regular Languages
Function distinguishable languages were introduced as a new methodology of defining characterizable subclasses of the regular languages which are learnable from text. Here, we give details on the implementation and the analysis of the corresponding learning algorithms. We also discuss problems which might occur in practical applications.
KeywordsDistinguishing Function Regular Language Inference Algorithm Language Family Tree Automaton
- 3.T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to Algorithms. MIT Press, 2nd. edition, 2001.Google Scholar
- 9.H. Fernau. Learning tree languages from text. In J. Kivinen, editor, Conference on Learning Theory COLT’02, to appear in the LNCS/LNAI series of Springer.Google Scholar
- 12.C. de la Higuera. Current trends in grammatical inference. In F. J. Ferri et al., editors, Advances in Pattern Recognition, Joint IAPR International Workshops SSPR+SPR’2000, volume 1876 of LNCS, pages 28–31. Springer, 2000.Google Scholar
- 13.V. Radhakrishnan. Grammatical Inference from Positive Data: An Effective Integrated Approach. PhD thesis, Department of Computer Science and Engineering, Indian Institute of Technology, Bombay (India), 1987.Google Scholar