Skip to main content
SpringerLink
Log in
Book cover

International Colloquium on Grammatical Inference

ICGI 2008: Grammatical Inference: Algorithms and Applications pp 295–297Cite as

Learning of Regular ω-Tree Languages

  • Conference paper

  • 461 Accesses

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

Abstract

We introduce two subclasses of regular ω-tree languages called local ω-tree languages and Buchi local ω-tree languages. Automata characterization for these ω-tree languages is given. For these subclasses and ω-regular tree languages learning algorithms are given.

This is a preview of subscription content, 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   74.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   99.00
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

Learn about institutional subscriptions

References

  1. Gecseg, F., Steinby, M.: Tree languages. In: Handbook of Formal Languages, vol. 3, pp. 1–68. Springer, Heidelberg (1997)

    Google Scholar 

  2. Saoudi, A.: Rational and recognizable infinite tree sets. In: Tree Automata and Languages, pp. 225–234. Elsevier Science, Amsterdam (1992)

    Google Scholar 

  3. Saoudi, A., Yokomori, T.: Learning local and recognizable ω-languages and Monadic Logic Programs. In: Proc. EuroColt, 1993, pp. 157–169. Oxford Univ. Press, Oxford (1994)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Arignar Anna Government Arts College, Walajapet,  

    M. Jayasrirani & M. H. Begam

  2. Madras Christian College, Chennai, 600 059,  

    D. G. Thomas

Authors
  1. M. Jayasrirani
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. M. H. Begam
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. D. G. Thomas
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Alexander Clark François Coste Laurent Miclet

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Jayasrirani, M., Begam, M.H., Thomas, D.G. (2008). Learning of Regular ω-Tree Languages. In: Clark, A., Coste, F., Miclet, L. (eds) Grammatical Inference: Algorithms and Applications. ICGI 2008. Lecture Notes in Computer Science(), vol 5278. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-88009-7_27

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-88009-7_27

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-88008-0

  • Online ISBN: 978-3-540-88009-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation