Skip to main content
Springer Nature Link
Log in

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

  • Conference paper
Grammatical Inference: Algorithms and Applications (ICGI 2006)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 4201))

Included in the following conference series:

  • 553 Accesses

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.

This work is supported in part by Grants-in-Aid for Scientific Research Nos. 13680435, 16300001 and 18500108 from the Ministry of Education, Culture, Sports, Science and Technology of Japan.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Angluin, D.: Inductive inference of formal languages from positive data. Inform. and Control 45, 117–135 (1980)

    Article  MATH  MathSciNet  Google Scholar 

  2. Angluin, D.: Inference of reversible languages. J. ACM 29, 741–765 (1982)

    Article  MATH  MathSciNet  Google Scholar 

  3. Berstel, J., Perrin, D.: Theory of Codes. Academic Press, Inc., London (1985)

    MATH  Google Scholar 

  4. Gold, E.M.: Language identification in the limit. Inform. and Control 10, 447–474 (1967)

    Article  MATH  Google Scholar 

  5. Harrison, M.A.: Introduction to Formal Language Theory. Addison-Wesley, Reading (1972)

    Google Scholar 

  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. Mäkinen, E.: The grammatical inference problem for the Szilard languages of linear grammars. Inform. Process. Lett. 36, 203–206 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  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. 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. Yokomori, T.: On polynomial-time learnability in the limit of strictly deterministic automata. Machine Learning 19, 153–179 (1995)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Information and Communication Engineering, Faculty of Electro-Communications, The University of Electro-Communications, Chofugaoka 1–5–1, Chofu, Tokyo, 182-8585, Japan

    Mitsuo Wakatsuki, Etsuji Tomita & Go Yamada

Authors
  1. Mitsuo Wakatsuki
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Etsuji Tomita
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Go Yamada
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Biosciences and Informatics, Keio University, 3-14-1 Hiyoshi, Kohoku-ku, 223-8522, Yokohama, Japan

    Yasubumi Sakakibara

  2. Dept. of Computer Science, Kyoto Sangyo University, Kamigamo Motoyama, Kita-ku, Kyoto, Japan

    Satoshi Kobayashi

  3. Japan Biological Informatics Consortium, 10F TIME24 Building, 2-45 Aomi, Koto-ku, 135-8073, Tokyo, Japan

    Kengo Sato

  4. Department of Information and Communication Engineering, Graduate School of Electro-Communications, The University of Electro-Communications, 1-5-1 Chofugaoka, Chofu-shi, 182-8585, Tokyo, Japan

    Tetsuro Nishino

  5. Department of Information and Communication Engineering, Faculty of Electro-Communications, The University of Electro-Communications, Chofugaoka 1–5–1, Chofu, 182-8585, Tokyo, Japan

    Etsuji Tomita

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wakatsuki, M., Tomita, E., Yamada, G. (2006). A Unified Algorithm for Extending Classes of Languages Identifiable in the Limit from Positive Data. In: Sakakibara, Y., Kobayashi, S., Sato, K., Nishino, T., Tomita, E. (eds) Grammatical Inference: Algorithms and Applications. ICGI 2006. Lecture Notes in Computer Science(), vol 4201. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11872436_14

Download citation

  • DOI: https://doi.org/10.1007/11872436_14

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-45264-5

  • Online ISBN: 978-3-540-45265-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics