Skip to main content

Inferring Subclasses of Contextual Languages

  • Conference paper
Grammatical Inference: Algorithms and Applications (ICGI 2000)

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

Included in the following conference series:

Abstract

In this paper, we show that the languages generated by internal contextual grammars are not inferable from positive data only. We define two subclasses of internal contextual languages, namely, k-uniform and strictly internal contextual languages which are incomparable classes and provide an algorithm to learn these classes. The algorithm can be used when the rules are applied in a parallel mode.

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

Access this chapter

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. Angluin, D.: Inductive inference of formal languages from positive data. Information and Control 45, 117–135 (1980)

    Article  MATH  MathSciNet  Google Scholar 

  2. Ehrenfeucht, A., Paun, G., Rozenberg, G.: Contextual grammars and natural languages. In: Handbook of Formal Languages, vol. 2, pp. 237–293. springer, Heidelberg (1997)

    Google Scholar 

  3. Ehrenfeucht, A., Paun, G., Rozenberg, G.: On representing recursively enumerable languages by internal contextual languages. Theoretical Computer Science 205, 61–83 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  4. Koshiba, T., Mäkinen, E., Takada, Y.: Inferring pure context-free languages from positive data, Technical Report A-1997-14, University of Tampere, Finland (To appear in Acta Cybernetica)

    Google Scholar 

  5. Marcus, S.: Contextual grammars. Rev. Roum. Math. Pures Appl. 14(10), 1525–1534 (1969)

    MATH  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  7. Mitrana, V.: Parallelism in contextual grammars. Fundamenta Informaticae 33, 281–294 (1998)

    MATH  MathSciNet  Google Scholar 

  8. Tanida, N., Yokomori, T.: Inductive inference of monogenic pure context- free languages. In: Arikawa, S., Jantke, K.P. (eds.) AII 1994 and ALT 1994. LNCS (LNAI), vol. 872, pp. 560–573. Springer, Heidelberg (1994)

    Google Scholar 

  9. Yokomori, T.: 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

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Emerald, J.D., Subramanian, K.G., Thomas, D.G. (2000). Inferring Subclasses of Contextual Languages. In: Oliveira, A.L. (eds) Grammatical Inference: Algorithms and Applications. ICGI 2000. Lecture Notes in Computer Science(), vol 1891. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45257-7_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-45257-7_6

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-41011-9

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics