Skip to main content
SpringerLink
Log in
Book cover

International Colloquium on Grammatical Inference

ICGI 2008: Grammatical Inference: Algorithms and Applications pp 280–282Cite as

Learning Subclasses of Pure Pattern Languages

  • Conference paper

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

Abstract

Pattern language learning algorithms within the inductive inference model and query learning setting have been of great interest. In this paper, we study the problem of learning pure pattern languages using queries and examples.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   74.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   99.00
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. Abisha, P.J., Subramanian, K.G., Thomas, D.G.: Pure Pattern Grammars. In: Proceedings of International Workshop on Grammar Systems, Austria, pp. 253–262 (2000)

    Google Scholar 

  2. Angluin, D.: Finding patterns common to a set of strings. Journal of Computer and System Sciences 21, 46–62 (1980)

    Article  MATH  MathSciNet  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. Berstel, J., Perrin, D.: The Theory of Codes. Academic Press, New York (1985)

    Google Scholar 

  5. Dassow, J., Paun, G., Salomaa, A.: Grammars based on patterns. International Journal of Foundations of Computer Science 4, 1–14 (1993)

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Madras Christian College, Chennai, 600 059,  

    P. J. Abisha & D. G. Thomas

  2. Department of Mathematics, Crescent Engineering College, Chennai, 600 048,  

    Sindhu J. Kumaar

Authors
  1. P. J. Abisha
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. D. G. Thomas
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Sindhu J. Kumaar
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Alexander Clark François Coste Laurent Miclet

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Abisha, P.J., Thomas, D.G., Kumaar, S.J. (2008). Learning Subclasses of Pure Pattern Languages. In: Clark, A., Coste, F., Miclet, L. (eds) Grammatical Inference: Algorithms and Applications. ICGI 2008. Lecture Notes in Computer Science(), vol 5278. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-88009-7_22

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-88009-7_22

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-88008-0

  • Online ISBN: 978-3-540-88009-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation