Skip to main content
SpringerLink
Log in
SpringerLink
Log in

Types of Trusted Information That Make DFA Identification with Correction Queries Feasible

  • Conference paper
Implementation and Application of Automata (CIAA 2010)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6482))

Included in the following conference series:

  • 558 Accesses

Abstract

In the query learning model, the problem of efficiently identifying a deterministic finite automaton (DFA) has been widely investigated. While DFAs are known to be polynomial time learnable with a combination of membership queries (MQs) and equivalence queries (EQs), each of these types of queries alone are not enough to provide sufficient information for the learner. Therefore, the possibility of having some extra-information shared between the learner and the teacher has been discussed. In this paper, the problem of efficient DFA identification with correction queries (CQs) - an extension of MQs - when additional information is provided to the learner is addressed. We show that knowing the number of states of the target DFA does not help (similar to the case of MQs or EQs), but other parameters such as the reversibility or injectivity degree are useful.

This work was financially supported by Ministerio de Educación y Ciencia de Españ a (MEC) grants JCDI-2009-04626 and MTM-2007-63422.

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.: On the complexity of minimum inference of regular sets. Information and Control 39(3), 337–350 (1978)

    Article  MathSciNet  MATH  Google Scholar 

  2. 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 

  3. Angluin, D.: Learning k-bounded context-free grammars. Technical Report TR-557, Yale University, New Haven, Conn. (1987)

    Google Scholar 

  4. Angluin, D.: Learning k-term DNF formulas using queries and counter-examples. Technical Report TR-559, Yale University, New Haven, Conn. (1987)

    Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

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

    MathSciNet  Google Scholar 

  7. Angluin, D.: Negative results for equivalence queries. Machine Learning 5(2), 121–150 (1990)

    Google Scholar 

  8. 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 

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

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  11. Goldman, S.A., Mathias, H.D.: Teaching a smarter learner. Journal of Computer and System Sciences 52(2), 255–267 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  12. Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading (1979)

    MATH  Google Scholar 

  13. Tîrnăucă, C.: Language Learning with Correction Queries. Ph.D. thesis, Universitat Rovira i Virgili, Tarragona, Spain (2009)

    Google Scholar 

  14. Tîrnăucă, C., Knuutila, T.: Efficient language learning with correction queries. Technical Report 822, Turku Center for Computer Science (2007)

    Google Scholar 

  15. Tîrnăucă, C., Knuutila, T.: Polynomial time algorithms for learning k-reversible languages and pattern languages with correction queries. In: Hutter, M., Servedio, R.A., Takimoto, E. (eds.) ALT 2007. LNCS (LNAI), vol. 4754, pp. 264–276. Springer, Heidelberg (2007)

    Google Scholar 

  16. Yu, S.: Regular languages. In: Salomaa, A., Rozenberg, G. (eds.) Handbook of Formal Languages. Word, Language, Grammar, vol. 1, ch. 2, pp. 41–110. Springer, Berlin (1997)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Departamento de Matemáticas, Estadística y Computación, Universidad de Cantabria, Avda. de los Castros s/n, 39005, Santander, Spain

    Cristina Tîrnăucă

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

    Cătălin Ionuţ Tîrnăucă

Authors
  1. Cristina Tîrnăucă
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Cătălin Ionuţ Tîrnăucă
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Manitoba, R3T 2N2, Winnipeg, MB, Canada

    Michael Domaratzki

  2. School of Computing, Queen’s University, K7L 3N6, Kingston, Ontario, Canada

    Kai Salomaa

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Tîrnăucă, C., Tîrnăucă, C.I. (2011). Types of Trusted Information That Make DFA Identification with Correction Queries Feasible. In: Domaratzki, M., Salomaa, K. (eds) Implementation and Application of Automata. CIAA 2010. Lecture Notes in Computer Science, vol 6482. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-18098-9_29

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-18098-9_29

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-18097-2

  • Online ISBN: 978-3-642-18098-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation