Skip to main content
SpringerLink
Log in

Query Learning of Regular Tree Languages: How to Avoid Dead States

  • Published:
Theory of Computing Systems Aims and scope Submit manuscript

Abstract

We generalize an inference algorithm by Angluin, that learns a regular string language from a "minimally adequate teacher", to regular tree languages. The (deterministic bottom-up) finite tree automaton constructed by the learning algorithm is the minimal partial one recognizing the unknown language. This improves a similar algorithm proposed by Sakakibara by avoiding dead states both in the resulting automaton and the learning phase, which also leads to a considerable improvement with respect to efficiency.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. Department of Computing Science, Umea University, S-901\,87 Umea, Sweden

    Frank Drewes & Johanna Högberg

Authors
  1. Frank Drewes
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Johanna Högberg
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding authors

Correspondence to Frank Drewes or Johanna Högberg.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Drewes, F., Högberg, J. Query Learning of Regular Tree Languages: How to Avoid Dead States. Theory Comput Syst 40, 163–185 (2007). https://doi.org/10.1007/s00224-005-1233-3

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00224-005-1233-3

Keywords

Search

Navigation