Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content

Bag Context Tree Grammars 

  • Conference paper
Developments in Language Theory (DLT 2006)

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

Included in the following conference series:

Abstract

We introduce bag context, a device for regulated rewriting in tree grammars. Rather than being part of the developing tree, bag context (bc) evolves on its own during a derivation. We show that the class of bc tree languages is the closure of the class of random context tree languages under linear top-down tree transductions. Further, an interchange theorem for subtrees of dense trees in bc tree languages is established. This result implies that the class of bc tree languages is incomparable with the class of branching synchronization tree languages.

The work reported here has been part of the project Random Context in the Generation and Transformation of Trees funded by the National Research Foundation South Africa (NRF) and the Swedish International Development Cooperation Agency (Sida).

This paper is a shortened version of [ETM + 06].

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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.

Similar content being viewed by others

References

  1. Baker, B.S.: Composition of top-down and bottom-up tree transductions. Information and Control 41, 186–213 (1979)

    Article  MATH  MathSciNet  Google Scholar 

  2. Drewes, F., Engelfriet, J.: Decidability of the finiteness of ranges of tree transductions. Information and Computation 145, 1–50 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  3. Drewes, F., Engelfriet, J.: Branching synchronization grammars with nested tables. Journal of Computer and System Sciences 68, 611–656 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  4. Dassow, J., Păun, G.: Regulated Rewriting in Formal Language Theory. EATCS Monographs in Theoretical Computer Science. Springer, Berlin (1989)

    Google Scholar 

  5. Drewes, F., du Toit, C., Ewert, S., Högberg, J., van der Merwe, B., van der Walt, A.P.J.: Random context tree grammars and tree transducers. South African Computer Journal 34, 11–25 (2005)

    Google Scholar 

  6. Ewert, S., du Toit, C., van der Merwe, B., van der Walt, A.P.J., Drewes, F., Högberg, J.: Bag tree grammars. Report UMINF 06.03, Umeå University (2006)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Drewes, F., du Toit, C., Ewert, S., van der Merwe, B., van der Walt, A.P.J. (2006). Bag Context Tree Grammars . In: Ibarra, O.H., Dang, Z. (eds) Developments in Language Theory. DLT 2006. Lecture Notes in Computer Science, vol 4036. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11779148_21

Download citation

  • DOI: https://doi.org/10.1007/11779148_21

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-35428-4

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics