Skip to main content
Springer Nature Link
Log in

Learning code regular and code linear languages

  • Session: Algebraic Methods and Algorithms 3
  • Conference paper
  • First Online:
Grammatical Interference: Learning Syntax from Sentences (ICGI 1996)

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

Included in the following conference series:

Abstract

In this paper, a subclass of regular languages, called code regular languages is defined. Algorithms for learning these languages are presented in the frame work of identification in the limit. Learning of analogous subclass of linear languages is also examined.

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. A.V.Aho and M.J.Corasick, Efficient string matching: an aid to bibliographic search, Communications of the ACM 18(6), 338–340, 1975.

    Google Scholar 

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

    Google Scholar 

  3. J.Berstel and D.Perrin, Theory of Codes, Academic Press, New York/London, 1985.

    Google Scholar 

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

    Article  Google Scholar 

  5. T.Head, Formal language theory and DNA:An analysis of the generative capacity of specific recombinant behaviours, Bulletin of Mathematical Biology, 49, 737–759, 1987.

    Article  PubMed  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  7. E. Makinen, A note on the grammatical inference problem for even linear languages, Fundamenta Informaticae, 25(2), 175–181, 1996.

    Google Scholar 

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

    Article  Google Scholar 

  9. V.Radhakrishnan and G.Nagaraja, Inference of even linear grammars and its application to picture description languages, Pattern Recognition, 21(1), 55–62, 1988.

    Article  MathSciNet  Google Scholar 

  10. J.M.Sempere and P.Garcia, A characterisation of even linear languages and its application to the learning problem, Lecture Notes in Artificial Intelligence 914, 38–44, Springer Verlag.

    Google Scholar 

  11. G.Siromoney, R.Siromoney and K.Krithivasan, Abstract families of matrices and picture languages, Comp. Graphics and Image Proc., 1, 234–307, 1972.

    Google Scholar 

  12. Y.Takada, Grammatical inference of even linear languages based on control sets, Information Processing Letters, 28(4), 193–199, 1988.

    Article  Google Scholar 

  13. N.Tanida and T.Yokomori, Polynomial time identification of strictly regular languages in the limit, IEICE Transactions on Information and Systems, E75-D, 125–132, 1992.

    Google Scholar 

  14. T.Yokomori, On polynomial-time learnability in the limit of strictly deterministic automata, Machine Learning, 19, 153–179, 1995.

    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

Laurent Miclet Colin de la Higuera

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Emerald, J.D., Subramanian, K.G., Thomas, D.G. (1996). Learning code regular and code linear languages. In: Miclet, L., de la Higuera, C. (eds) Grammatical Interference: Learning Syntax from Sentences. ICGI 1996. Lecture Notes in Computer Science, vol 1147. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0033356

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-70678-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics