Skip to main content
SpringerLink
Log in

Inferring Deterministic Linear Languages

  • Conference paper
  • First Online:
Computational Learning Theory (COLT 2002)

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

Included in the following conference series:

Abstract

Linearity and determinism seem to be two essential conditions for polynomial language learning to be possible. We compare several definitions of deterministic linear grammars, and for a reasonable definition prove the existence of a canonical normal form. This enables us to obtain positive learning results in case of polynomial learning from a given set of both positive and negative examples. The resulting class is the largest one for which this type of results has been obtained so far.

This work was done when the first author visited the Departamento de Lenguajes y Sistemas Informáticos of the University of Alicante, Spain. The visit was sponsored by the Spanish Ministry of Education.

The second author thanks the Spanish CICyT for partial support of this work through project TIC2000-1703-C03-02.

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. Oncina, J., García, P.: Identifying regular languages in polynomial time. In Bunke, H., ed.: Advances in Structural and Syntactic Pattern Recognition. Volume 5 of Series in Machine Perception and Artificial Intelligence. World Scientific (1992) 99–108

    Google Scholar 

  2. Pitt, L., Warmuth, M.: The minimum consistent DFA problem cannot be approximated within any polynomial. Journal of the Association for Computing Machinery 40 (1993) 95–142

    MATH  MathSciNet  Google Scholar 

  3. Kearns, M., Valiant, L.: Cryptographic limitations on learning boolean formulae and finite automata. In: 21st ACM Symposium on Theory of Computing. (1989) 433–444

    Google Scholar 

  4. Sakakibara, Y.: Recent advances of grammatical inference. Theoretical Computer Science 185 (1997) 15–45

    Article  MATH  MathSciNet  Google Scholar 

  5. Lee, S.: Learning of context-free languages: A survey of the literature (1996)

    Google Scholar 

  6. de la Higuera, C.: Characteristic sets for polynomial grammatical inference. Machine Learning 27 (1997) 125–138

    Article  MATH  Google Scholar 

  7. Sempere, J., García, P.: A characterisation of even linear languages and its application to the learning problem. In: Grammatical Inference and Applications, ICGI’94. Number 862 in Lecture Notes in Artificial Intelligence, Springer Verlag (1994) 38–44

    Google Scholar 

  8. Takada, Y.: A hierarchy of language families learnable by regular language learners. In: Grammatical Inference and Applications, ICGI’94. Number 862 in Lecture Notes in Artificial Intelligence, Springer Verlag (1994) 16–24

    Google Scholar 

  9. Sakakibara, Y., Kondo, M.: Ga-based learning of context-free grammars using tabular representations. In: Proceedings of 16th International Conference on Machine Learning (ICML-99). (1999) 354–360

    Google Scholar 

  10. Sakakibara, Y.: Learning context-free grammars from structural data in polynomial time. Theoretical Computer Science 76 (1990) 223–242

    Article  MathSciNet  MATH  Google Scholar 

  11. Sakakibara, Y., Brown, M., Hughley, R., Mian, I., Sjolander, K., Underwood, R., Haussler, D.: Stochastic context-free grammars for trna modeling. Nuclear Acids Res. 22 (1994) 5112–5120

    Article  Google Scholar 

  12. Ishizaka, I.: Learning simple deterministic languages. In: Proceedings of COLT 89. (1989)

    Google Scholar 

  13. Angluin, D.: Learning regular sets from queries and counterexamples. Information and Control 39 (1987) 337–350

    Article  MathSciNet  Google Scholar 

  14. Pitt, L.: Inductive inference, DFA’s, and computational complexity. In: Analogical and Inductive Inference. Number 397 in Lecture Notes in Artificial Intelligence. Springer-Verlag, Berlin (1989) 18–44

    Google Scholar 

  15. Autebert, J., Berstel, J., Boasson, L.: Context-free languages and pushdown automata. In Salomaa, A., Rozenberg, G., eds.: Handbook of Formal Languages. Volume 1, Word Language Grammar. Springer-Verlag, Berlin (1997) 111–174

    Google Scholar 

  16. Nasu, M., Honda, N.: Mappings induced by pgsm-mappings and some recursively unsolvable problems of finite probabilistic automata. Information and Control 15 (1969) 250–273

    Article  MATH  MathSciNet  Google Scholar 

  17. Ibarra, O. H., Jiang, T., Ravikumar, B.: Some subclasses of context-free languages in nc1. Information Processing Letters 29 (1988) 111–117

    Article  MATH  MathSciNet  Google Scholar 

  18. Holzer, M., Lange, K. J.: On the complexities of linear ll(1) and lr(1) grammars. In: Proceedings of the 9th International Conference on Fundamentals of Computation Theory. Number 710 in Lecture Notes in Computer Science, Springer Verlag (1993) 299–308

    Google Scholar 

  19. Valiant, L.: A theory of the learnable. Communications of the Association for Computing Machinery 27 (1984) 1134–1142

    MATH  Google Scholar 

  20. Gold, E.: Complexity of automaton identification from given data. Information and Control 37 (1978) 302–320

    Article  MATH  MathSciNet  Google Scholar 

  21. Parekh, R., Honavar, V.: Learning dfa from simple examples. Machine Learning Journal 44 (2001) 9–35

    Article  MATH  Google Scholar 

  22. Parekh, R., Honavar, V.: On the relationship between models for learning in helpful environments. In Oliveira, A., ed.: Proceedings of ICGI 2000. Volume 1891 of Lecture Notes in Artificial Intelligence., Berlin Heidelberg New York, Springer Verlag (2000) 207–220

    Google Scholar 

  23. Ginsburg, S., Spanier, E.: Finite-turn pushdown automata. SIAM Control 4 (1966) 429–453

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. EURISE, Université de Saint-Etienne, 23 rue du Docteur Paul Michelon, 42023, Saint-Etienne, France

    Colin de la Higuera

  2. Departamento de Lenguajes y Sistemas Informáticos, Universidad de Alicante, Ap.99, E-03080, Alicante, Spain

    Jose Oncina

Authors
  1. Colin de la Higuera
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jose Oncina
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Research School of Information Sciences and Engineering, Australian National University, Canberra, ACT, 0200, Australia

    Jyrki Kivinen

  2. Computer Science Department, University of Illinois at Chicago, 851 S. Morgan St., Chicago, IL, 60607, USA

    Robert H. Sloan

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

de la Higuera, C., Oncina, J. (2002). Inferring Deterministic Linear Languages. In: Kivinen, J., Sloan, R.H. (eds) Computational Learning Theory. COLT 2002. Lecture Notes in Computer Science(), vol 2375. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45435-7_13

Download citation

  • DOI: https://doi.org/10.1007/3-540-45435-7_13

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43836-6

  • Online ISBN: 978-3-540-45435-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation