Skip to main content
Springer Nature Link
Log in

Learning Subclasses of Parallel Communicating Grammar Systems

  • Conference paper
Grammatical Inference: Theoretical Results and Applications (ICGI 2010)

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

Included in the following conference series:

  • 824 Accesses

Abstract

Pattern language learning algorithms within the inductive inference model and query learning setting have been of great interest. In this paper an algorithm to learn a parallel communicating grammar system in which the master component is a regular grammar and the other components are pure pattern grammars is given.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

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. Abisha, P.J., Subramanian, K.G., Thomas, D.G.: Pure Pattern Grammars. In: Proceedings of International Workshop Grammar Systems, Austria, pp. 253–262 (2000)

    Google Scholar 

  2. Abisha, P.J., Thomas, D.G., Kumaar, S.J.: Learning Subclasses of Pure Pattern Languages. In: Clark, A., Coste, F., Miclet, L. (eds.) ICGI 2008. LNCS (LNAI), vol. 5278, pp. 280–283. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  3. Angluin, D.: Learning Regular Sets from Queries and Counter Examples. Information and Computation 75, 87–106 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  4. Dassow, J., Paun, G., Rozenberg, G.: Generating Languages in a Distributed Way: Grammar Systems. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages. Springer, Heidelberg (1997)

    Google Scholar 

  5. Gold, E.M.: Language Identification in the Limit. Information and Control 10, 447–474 (1967)

    Article  MATH  Google Scholar 

  6. Salomaa, A.: Formal Languages. Academic Press, New York (1973)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, B.S. Abdur Rahman University, Chennai, 600 048, Tamil Nadu, India

    Sindhu J. Kumaar

  2. Department of Mathematics, Madras Christian College, East Tambaram, Chennai, 600 059, Tamil Nadu, India

    P. J. Abisha & D. G. Thomas

Authors
  1. Sindhu J. Kumaar
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. P. J. Abisha
    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

Editors and Affiliations

  1. Departamento de Sistemas Informáticos y Computatión, Universidad Politécnica de Valencia, Camino de Vera s/n, 46022, Valencia, Spain

    José M. Sempere  & Pedro García  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kumaar, S.J., Abisha, P.J., Thomas, D.G. (2010). Learning Subclasses of Parallel Communicating Grammar Systems. In: Sempere, J.M., García, P. (eds) Grammatical Inference: Theoretical Results and Applications. ICGI 2010. Lecture Notes in Computer Science(), vol 6339. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15488-1_31

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-15488-1_31

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-15487-4

  • Online ISBN: 978-3-642-15488-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics