Skip to main content
Springer Nature Link
Log in

Learning behaviors of automata from shortest counterexamples

  • Conference paper
  • First Online:
Computational Learning Theory (EuroCOLT 1995)

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

Included in the following conference series:

  • 153 Accesses

Abstract

Generalizing a result of Ibarra and Jiang on the learning of regular languages from counterexamples, we show a polynomial time algorithm that exactly identifies an unknown Q-automaton from equivalence queries, given an oracle that provides counterexamples which are minimal w.r.t. the alphabetic ordering.

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.

Similar content being viewed by others

References

  1. D. Angluin. A note on the number of queries needed to identify regular languages. Information and Control, 51:76–87, 1981.

    Google Scholar 

  2. D. Angluin. Learning regular sets from queries and counterexamples. Information and Computation, 75:87–106, 1987.

    Google Scholar 

  3. D. Angluin. Negative results for equivalence queries. Machine Learning, 5:121–150, 1990.

    Google Scholar 

  4. F. Bergadano and S. Varricchio. Learning Behaviors of Automata from Equivalence and Multiplicity Queries (Extended Abstract), Lecture Notes in Computer Science, Vol. 778, pages 54–62, 1994.

    Google Scholar 

  5. F. Bergadano and S. Varricchio. Learning Behaviors of Automata from Equivalence and Multiplicity Queries. SIAM Journal on Computing, to appear.

    Google Scholar 

  6. J. Berstel and C. Reutenauer. Rational series and their languages Springer-Verlag, Berlin, 1988.

    Google Scholar 

  7. S. Eilenberg Automata, Languages and Machines Vol. A, Academic Press, New York, 1974.

    Google Scholar 

  8. O. Ibarra and T. Jiang. Learning regular languages from counterexamples Proc of 1988 Workshop on Computational Learning Theory, 5: 371–385 1988.

    Google Scholar 

  9. A. Salomaa and M. Soittola. Automata theoretic aspects of formal power series Springer-Verlag, New York, 1978.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Universita' di Messina, Italy

    F. Bergadano

  2. Universita' dell'Aquila, Italy

    S. Varricchio

Authors
  1. F. Bergadano
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. S. Varricchio
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Paul Vitányi

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bergadano, F., Varricchio, S. (1995). Learning behaviors of automata from shortest counterexamples. In: Vitányi, P. (eds) Computational Learning Theory. EuroCOLT 1995. Lecture Notes in Computer Science, vol 904. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-59119-2_193

Download citation

  • DOI: https://doi.org/10.1007/3-540-59119-2_193

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-59119-1

  • Online ISBN: 978-3-540-49195-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics