Skip to main content
SpringerLink
Log in

Learning a subclass of context-free languages

  • Conference paper
  • First Online:
Book cover Grammatical Inference (ICGI 1998)

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

Included in the following conference series:

Abstract

In this paper, Apical growth Pure context-free grammars (AGPCFG) which are a variation of the pure grammars of Maurer et al are introduced. These grammars allow rewriting of active symbols at the ends of a string simultaneously. They also provide a variation of another kind of grammars called filamentous systems with apical growth, which are motivated by biological considerations. The family of languages generated by AGPCFGs is a subclass of context-free languages. An algorithm for learning this language subclass, in the framework of identification in the limit from positive examples, is provided.

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, Inference of reversible languages, J. ACM 29, 1982, 741–765.

    Article  MATH  MathSciNet  Google Scholar 

  2. J.D. Emerald, K.G. Subramanian and D.G. Thomas, Learning Code regular and Code linear languages, Proceedings of ICGI-96, Lecture Notes in Artificial In-telligence 1147, 1996, 211–221.

    MathSciNet  Google Scholar 

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

    Article  MATH  Google Scholar 

  4. T. Koshiba, E. Makinen and Y. Takada, Inferring pure context-free languages from positive data, Technical Report A-1997-14, Department of Computer Science, University of Tampere, 1997.

    Google Scholar 

  5. E. Makinen, The grammatical inference problem for the Szilard languages of linear grammars, Information Processing Letters, 36, 203–206, 1990.

    Article  MathSciNet  Google Scholar 

  6. H.A. Maurer, A. Salomaa and D. Wood, Pure Grammars, Information and Control 44, 47–72, 1980.

    Article  MATH  MathSciNet  Google Scholar 

  7. H.A. Maurer, G. Rozenberg and E. Welzl, Using string languages to describe picture languages, Information and Control, 54, 155–185, 1992.

    Article  MathSciNet  Google Scholar 

  8. N. Nirmal, K. Krithivasan, Filamentous Systems with apical growth, Intern. J. Comp. Inf. Sci. 14, 1985, 235–242.

    Google Scholar 

  9. Y. Sakakibara, Learning context-free grammars from structural data in polynomial time, Theoretical Computer Science, 76(2): 223–242, 1990.

    Article  MATH  MathSciNet  Google Scholar 

  10. K.G. Subramanian, A note on regular-controlled apical growth filamentous systems,Intern. J.Comp.Inf.Sci.14, 1985, 235–242.

    Article  MATH  MathSciNet  Google Scholar 

  11. N. Tanida and T. Yokomori, Inductive Inference of Monogenic Pure Context-free languages, Lecture Notes in Artificial Intelligence, 872, Springer-Verlag, 1994, 560–573.

    Google Scholar 

  12. T. Yokomori, 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 Mathematics, Madras Christian College, 600 059, Tambaram, Madras, India

    J. D. Emerald, K. G. Subramanian & D. G. Thomas

Authors
  1. J. D. Emerald
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. K. G. Subramanian
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. D. G. Thomas
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Vasant Honavar Giora Slutzki

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Emerald, J.D., Subramanian, K.G., Thomas, D.G. (1998). Learning a subclass of context-free languages. In: Honavar, V., Slutzki, G. (eds) Grammatical Inference. ICGI 1998. Lecture Notes in Computer Science, vol 1433. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0054078

Download citation

  • DOI: https://doi.org/10.1007/BFb0054078

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64776-8

  • Online ISBN: 978-3-540-68707-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation