Skip to main content
SpringerLink
Log in

Learning Finite Automata Using Label Queries

  • Conference paper
Algorithmic Learning Theory (ALT 2009)

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

Included in the following conference series:

Abstract

We consider the problem of learning a finite automaton M of n states with input alphabet X and output alphabet Y when a teacher has helpfully or randomly labeled the states of M using labels from a set L. The learner has access to label queries; a label query with input string w returns both the output and the label of the state reached by w. Because different automata may have the same output behavior, we consider the case in which the teacher may “unfold” M to an output equivalent machine M′ and label the states of M′ for the learner. We give lower and upper bounds on the number of label queries to learn the output behavior of M in these different scenarios. We also briefly consider the case of randomly labeled automata with randomly chosen transition functions.

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. Angluin, D.: A note on the number of queries needed to identify regular languages. Information and Control 51(1), 76–87 (1981)

    Article  MathSciNet  MATH  Google Scholar 

  2. Angluin, D.: Queries and concept learning. Machine Learning 2(4), 319–342 (1987)

    MathSciNet  Google Scholar 

  3. Becerra-Bonache, L., Dediu, A.H., Tîrnăucă, C.: Learning DFA from correction and equivalence queries. In: Sakakibara, Y., Kobayashi, S., Sato, K., Nishino, T., Tomita, E. (eds.) ICGI 2006. LNCS (LNAI), vol. 4201, pp. 281–292. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  4. Domaratzki, M., Kisman, D., Shallit, J.: On the number of distinct languages accepted by finite automata with n states. Journal of Automata, Languages and Combinatorics 7(4) (2002)

    Google Scholar 

  5. Freund, Y., Kearns, M.J., Ron, D., Rubinfeld, R., Schapire, R.E., Sellie, L.: Efficient learning of typical finite automata from random walks. Information and Computation 138(1), 23–48 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  6. Korshunov, A.: The degree of distinguishability of automata. Diskret. Analiz. 10(36), 39–59 (1967)

    Google Scholar 

  7. Lee, D., Yannakakis, M.: Testing finite-state machines: State identification and verification. IEEE Trans. Computers 43(3), 306–320 (1994)

    Article  MathSciNet  Google Scholar 

  8. Trakhtenbrot, B.A., Barzdin’, Y.M.: Finite Automata: Behavior and Synthesis. North-Holland, Amsterdam (1973)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Yale University, 51 Prospect Street, New Haven, CT, USA

    Dana Angluin, Leonor Becerra-Bonache & Lev Reyzin

  2. Research Group on Mathematical Linguistics, Rovira i Virgili University, Avinguda Catalunya, 35, 43002, Tarragona, Spain

    Leonor Becerra-Bonache & Adrian Horia Dediu

  3. “Politehnica” University of Bucharest, Splaiul Independentei 313, 060042, Bucharest, Romania

    Adrian Horia Dediu

Authors
  1. Dana Angluin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Leonor Becerra-Bonache
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Adrian Horia Dediu
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Lev Reyzin
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Research Group, Departament de Llenguatges i Sistemes Informàtics, Universitat Politècnica de Catalunya,, LARCA Jordi Girona Salgado 1-3, 08034, Barcelona, Spain

    Ricard Gavaldà

  2. ICREA and Department of Economics, Pompeu Fabra Universitat, Ramon Trias Fargas 25-27, 08005, Barcelona, Spain

    Gábor Lugosi

  3. Division of Computer Science, Hokkaido University, N-14, W-9, 060-0814, Sapporo, Japan

    Thomas Zeugmann

  4. Department of Computer Science, University of Regina, S4S 0A2, Regina, Saskatchewan, Canada

    Sandra Zilles

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Angluin, D., Becerra-Bonache, L., Dediu, A.H., Reyzin, L. (2009). Learning Finite Automata Using Label Queries. In: Gavaldà, R., Lugosi, G., Zeugmann, T., Zilles, S. (eds) Algorithmic Learning Theory. ALT 2009. Lecture Notes in Computer Science(), vol 5809. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04414-4_17

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-04414-4_17

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-04413-7

  • Online ISBN: 978-3-642-04414-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation