Skip to main content
SpringerLink
Log in

An Inverse Limit of Context-Free Grammars – A New Approach to Identifiability in the Limit

  • 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:

  • 340 Accesses

Abstract

The class of context-free grammars is studied. We transform results reached in [10] into terminology which meets Category theory. If a context-free language L is given, our approach enables to describe lucidly the whole structure of all context-free grammars (with the same set of terminals) in Chomsky normal form generating L.

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

Access this chapter

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Cohn, P.M.: Universal Algebra. Harper & Row, New York (1965)

    MATH  Google Scholar 

  2. Drášil, M.: A grammatical inference for C-finite languages. Arch. Math. Brno 25(3), 163–174 (1989)

    MATH  MathSciNet  Google Scholar 

  3. Dupont, P.: Regular grammatical inference from positive and negative samples by genetic search: the GIG method. In: Carrasco, R.C., Oncina, J. (eds.) ICGI 1994. LNCS (LNAI), vol. 862, pp. 236–245. Springer, Heidelberg (1994)

    Google Scholar 

  4. Fu, K.S., Taylor, L.B.: Grammatical inference: Introduction and survey. IEEE Transactions on Systems, Man and Cybernetics SMC-5(1), 95–111 (1975)

    Article  Google Scholar 

  5. de la Higuera, C., Oncina, J., Vidal, E.: Identification of DFA: Data-dependent versus data-independent algorithms. In: Miclet, L., de la Higuera, C. (eds.) ICGI 1996. LNCS (LNAI), vol. 1147, pp. 313–325. Springer, Heidelberg (1996)

    Chapter  Google Scholar 

  6. Hopcroft, J.E., Ullmann, J.D.: Formal Languages and their Relation to Automata. Addison-Wesley, Reading (1969)

    MATH  Google Scholar 

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

    Article  MATH  Google Scholar 

  8. Grätzer, G.: Universal Algebra, Van Nostrand. Princeton, New Jersey (1968)

    MATH  Google Scholar 

  9. Koshiba, T., Mäkinen, E., Takada, Y.: Learning deterministic even linear languages from positive examples. Theoret. Comput. Sci. 185, 63–79 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  10. Martinek, P.: On a Construction of Context-free Grammars. Fundamenta Informaticae (to appear)

    Google Scholar 

  11. Novotný, M.: On some constructions of grammars for linear languages. Intern. J. Computer Math. 17, 65–77 (1985)

    Article  MATH  Google Scholar 

  12. Sakakibara, Y.: Efficient learning of context-free grammars from positive structural examples. Inform. Comput. 97, 23–60 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  13. Sakakibara, Y.: Recent advances of grammatical inference. Theoret. Comput. Sci. 185, 15–45 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  14. Sempere, J.M., Fos, A.: Learning linear grammars from structural information. In: Miclet, L., de la Higuera, C. (eds.) ICGI 1996. LNCS (LNAI), vol. 1147, pp. 126–133. Springer, Heidelberg (1996)

    Chapter  Google Scholar 

  15. Tanatsugu, K.: A grammatical inference for harmonic linear languages. Intern. J. of Comput. and Inform. Sci. 13(5), 413–423 (1984)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Mendel University of Agriculture and Forestry, Zemědělská 3, 613 00, Brno, Czech Republic

    Pavel Martinek

Authors
  1. Pavel Martinek
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. INESC-ID/IST, R. Alves Redol 9, 1000, Lisboa, Portugal

    Arlindo L. Oliveira

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Martinek, P. (2000). An Inverse Limit of Context-Free Grammars – A New Approach to Identifiability in the Limit. 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_14

Download citation

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

  • 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

Search

Navigation