Advertisement

A Unified Algorithm for Extending Classes of Languages Identifiable in the Limit from Positive Data

  • Mitsuo Wakatsuki
  • Etsuji Tomita
  • Go Yamada
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4201)

Abstract

We are concerned with a unified algorithm for extending classes of languages identifiable in the limit from positive data. Let \( {\mathcal L} \) be a class of languages to be based on and let \( {\mathcal X} \) be a class of finite subsets of strings. The extended class of \( {\mathcal L} \), denoted by \( {\mathcal C}({\mathcal L}, {\mathcal X}) \), is defined by these \({\mathcal L} \) and \( {\mathcal X} \). Here we give a sufficient condition for \( {\mathcal C}({\mathcal L}, {\mathcal X}) \) to be identifiable in the limit from positive data and we present a unified identification algorithm for it. Furthermore, we show that some proper subclasses of \( {\mathcal C}({\mathcal L}, {\mathcal X}) \) are polynomial time identifiable in the limit from positive data in the sense of Yokomori.

Keywords

Polynomial Time Target Language Inductive Inference Regular Language Positive Data 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Angluin, D.: Inductive inference of formal languages from positive data. Inform. and Control 45, 117–135 (1980)zbMATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    Angluin, D.: Inference of reversible languages. J. ACM 29, 741–765 (1982)zbMATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    Berstel, J., Perrin, D.: Theory of Codes. Academic Press, Inc., London (1985)zbMATHGoogle Scholar
  4. 4.
    Gold, E.M.: Language identification in the limit. Inform. and Control 10, 447–474 (1967)zbMATHCrossRefGoogle Scholar
  5. 5.
    Harrison, M.A.: Introduction to Formal Language Theory. Addison-Wesley, Reading (1972)Google Scholar
  6. 6.
    Kobayashi, S., Yokomori, T.: Identifiability of subspaces and homomorphic images of zero-reversible languages. In: Li, M. (ed.) ALT 1997. LNCS (LNAI), vol. 1316, pp. 48–61. Springer, Heidelberg (1997)Google Scholar
  7. 7.
    Mäkinen, E.: The grammatical inference problem for the Szilard languages of linear grammars. Inform. Process. Lett. 36, 203–206 (1990)zbMATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    Pitt, L.: Inductive inference, DFAs, and computational complexity. In: Jantke, K.P. (ed.) AII 1989. LNCS (LNAI), vol. 397, pp. 18–44. Springer, Heidelberg (1989)Google Scholar
  9. 9.
    Tanida, N., Yokomori, T.: Polynomial-time identification of strictly regular languages in the limit. IEICE Trans. on Inform. and Systems E75-D, 125–132 (1992)Google Scholar
  10. 10.
    Yokomori, T.: On polynomial-time learnability in the limit of strictly deterministic automata. Machine Learning 19, 153–179 (1995)zbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Mitsuo Wakatsuki
    • 1
  • Etsuji Tomita
    • 1
  • Go Yamada
    • 1
  1. 1.Department of Information and Communication Engineering, Faculty of Electro-CommunicationsThe University of Electro-CommunicationsChofu, TokyoJapan

Personalised recommendations