Skip to main content
SpringerLink
Log in

Learning context-free languages efficiently

A report on recent results in Japan

  • Invited Lectures
  • Conference paper
  • First Online:
Analogical and Inductive Inference (AII 1989)

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

Included in the following conference series:

Abstract

This paper reports some of the recent results in Japan, focussing on the inductive inference of context-free languages. The paper does not intend the thorough survey on this topic, rather intend to provide extended abstracts of recent results developed in Japan. The contents of the present paper are as follows:

  1. 1.

    Introduction

  2. 2.

    Preliminaries

  3. 3.

    Learning Fullclass of Context-free Languages

  4. 3.1

    Efficient Learning from Structural Data

  5. 3.2

    Non-grammatical Learning

  6. 4.

    Learning Subclasses Efficiently

  7. 4.1

    Linear Languages

  8. 4.2

    Simple Deterministic Languages

  9. 5.

    Discussions

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.

References

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

    Google Scholar 

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

    Google Scholar 

  3. D. Angluin. Learning regular sets from queries and counterexamples. Information and Computation, 75:87–106, 1987.

    Google Scholar 

  4. S. Arikawa, T. Shinohara, and A. Yamamoto. Elementary Formal System as a Unfying Framework for Language Learning. Tech.Rep., Res. Inst. of Fund. Inf. Sci., Kyushu Univ., 1989.

    Google Scholar 

  5. W. S. Brainerd. The minimalization of tree automata. Information and Control, 13:484–491, 1968.

    Google Scholar 

  6. S. Crespi-Reghizzi. An effective model for grammar inference. In B. Gilchrist, editor, Information Processing 71, pages 524–529, Elsevier North-Holland, 1972.

    Google Scholar 

  7. E. Gold. Language identification in the limit. Information and Control, 10:447–474, 1967.

    Google Scholar 

  8. J. Gruska. A characterization of context-free languages. Journal of Computer and System Sciences, 5:353–364, 1971.

    Google Scholar 

  9. J. E. Hopcroft and J. D. Ullman. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading, Massachusetts, 1979.

    Google Scholar 

  10. H. Ishizaka. Learning simple deterministic languages. Tech. Rep. 465, ICOT, Tokyo, 1989. Also to appear in Proc. COLT'89.

    Google Scholar 

  11. J.W.Lloyd. Foundations of Logic Programming. Springer-Verlag, 1987.

    Google Scholar 

  12. A. Korenjak and J. Hopcroft. Simple deterministic languages. In Proceedings of 7th Annual IEEE Conference on Switching and Automata Theory, pages 36–46, 1966.

    Google Scholar 

  13. M.A. Harrison. Introduction to Formal Language Theory. Addison-Wesley, Reading, MA, 1978.

    Google Scholar 

  14. Y. Sakakibara. An efficient learning of context-free grammars for bottom-up parsing. In Proceedings of International Conference on Fifth Generation Computer Systems, pages 447–454, 1988.

    Google Scholar 

  15. Y. Sakakibara. Learning context-free grammars from structural data in polynomial time. In Proceedings of 1st Workshop on Computational Learning Theory, pages 296–310, 1988. To appear in Theoretical Computer Science.

    Google Scholar 

  16. E. Y. Shapiro. Inductive inference of theories from facts. Technical Report 192, Yale University Computer Science Dept., 1981.

    Google Scholar 

  17. Y. Takada. A constructive method for grammatical inference of linear languages based on control sets. Research Report 78, IIAS-SIS, FUJITSU LIMITED, 1987.

    Google Scholar 

  18. Y. Takada. Grammatical inference for even linear languages based on control sets. Information Processing Letters, 28:193–200, 1988.

    Google Scholar 

  19. K. Tanatsugu. A grammatical inference for context-free languages based on self-embedding. Bulletin of Informatics and Cybernetics, 22:149–163, 1987.

    Google Scholar 

  20. T. Yokomori. Inductive inference of contex-free languages based on context-free expressions. International Journal of Computer Mathematics, 24:115–140, 1988.

    Google Scholar 

  21. T. Yokomori. Learning simple languages in polynomial time. Tech. Rep., SIG-FAI, Japanese Society for AI, June, 1988.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Electro-Communications, 1-5-1 Chofugaoka, Chofu, 182, Tokyo, Japan

    Takashi Yokomori

Authors
  1. Takashi Yokomori
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Klaus P. Jantke

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Yokomori, T. (1989). Learning context-free languages efficiently. In: Jantke, K.P. (eds) Analogical and Inductive Inference. AII 1989. Lecture Notes in Computer Science, vol 397. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51734-0_54

Download citation

  • DOI: https://doi.org/10.1007/3-540-51734-0_54

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-51734-4

  • Online ISBN: 978-3-540-46798-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation