Skip to main content
SpringerLink
Log in

Learning a Regular Tree Language from a Teacher

  • Conference paper
  • First Online:
Developments in Language Theory (DLT 2003)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2710))

Included in the following conference series:

Abstract

We generalize an inference algorithm by Angluin, that learns a regular string language from a “minimally adequate teacher”, to regular tree languages. This improves a similar algorithm proposed by Sakakibara. In particular, we show how our algorithm can be used to avoid dead states, thus answering a question by Sakakibara.

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. Dana Angluin. Learning regular sets from queries and counterexamples. Information and Computation, 75:87–106, 1987.

    Article  MATH  MathSciNet  Google Scholar 

  2. W.S. Brainerd. The minimalization of tree automata. Information and Computation, 13:484–491, 1968.

    MATH  MathSciNet  Google Scholar 

  3. Frank Drewes. Tree-based picture generation. Theoretical Computer Science, 246:1–51, 2000.

    Article  MATH  MathSciNet  Google Scholar 

  4. Joost Engelfriet. Graph grammars and tree transducers. In S. Tison, editor, Proc. CAAP 94, volume 787 of Lecture Notes in Computer Science, pages 15–37. Springer, 1994.

    Chapter  Google Scholar 

  5. L.S. Levy and A.K. Joshi. Skeletal structural descriptions. Information and Control, 39:192–211, 1978.

    Article  MATH  MathSciNet  Google Scholar 

  6. Yasubumi Sakakibara. Learning context-free grammars from structural data in polynomial time. Theoretical Computer Science, 76:223–242, 1990.

    Article  MATH  MathSciNet  Google Scholar 

  7. James W. Thatcher and Jesse B. Wright. Generalized finite automata theory with an application to a decision-problem of second-order logic. Mathematical Systems Theory, 2:57–81, 1968.

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computing Science, Umeå University, S-901 87, Umeå, 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

Editor information

Editors and Affiliations

  1. Department of Informatics, University of Szeged, Árpád tér 2, 6720, Szeged, Hungary

    Zoltán Ésik  & Zoltán Fülöp  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Drewes, F., Högberg, J. (2003). Learning a Regular Tree Language from a Teacher. In: Ésik, Z., Fülöp, Z. (eds) Developments in Language Theory. DLT 2003. Lecture Notes in Computer Science, vol 2710. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45007-6_22

Download citation

  • DOI: https://doi.org/10.1007/3-540-45007-6_22

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40434-7

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation