Skip to main content
Log in

The Equivalence of Tree Adjoining Grammars and Monadic Linear Context-free Tree Grammars

  • Published:
Journal of Logic, Language and Information Aims and scope Submit manuscript

Abstract

The equivalence of leaf languages of tree adjoining grammars and monadic linear context-free grammars was shown about a decade ago. This paper presents a proof of the strong equivalence of these grammar formalisms. Non-strict tree adjoining grammars and monadic linear context-free grammars define the same class of tree languages. We also present a logical characterisation of this tree language class showing that a tree language is a member of this class iff it is the two-dimensional yield of an MSO-definable three-dimensional tree language.

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

Access this article

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

References

  • Engelfriet J., Schmidt E. M. (1977) IO and OI. I. Journal of Computer and System Sciences 15(3): 328–353

    Article  Google Scholar 

  • Fujiyoshi A. (2005) Linearity and nondeletion on monadic context-free tree grammars. Information Processing Letters 93(3): 103–107. doi:10.1016/j.ipl.2004.10.008

    Article  Google Scholar 

  • Fujiyoshi A., Kasai T. (2000) Spinal-formed context-free tree grammars. Theory of Computing Systems 33(1): 59–83

    Article  Google Scholar 

  • Gécseg F., Steinby M. (1997) Tree languages. In: Rozenberg G., Salomaa A. (eds) Handbook of formal languages, Vol. 3: Beyond words. Springer, Berlin, pp 1–68

    Chapter  Google Scholar 

  • Joshi A., Schabes Y. (1997) Tree adjoining grammars. In: Rozenberg G., Salomaa A. (eds) Handbook of formal languages, Vol 3: Beyond words. Springer, Berlin, pp 69–123

    Chapter  Google Scholar 

  • Joshi A., Levy L. S., Takahashi M. (1975) Tree adjunct grammar. Journal of Computer and System Sciences 10(1): 136–163

    Article  Google Scholar 

  • Kepser S., Mönnich U. (2006) Closure properties of linear context-free tree languages with an application to optimality theory. Theoretical Computer Science 354(1): 82–97

    Article  Google Scholar 

  • Lang B. (1994) Recognition can be harder than parsing. Computational Intelligence 10: 486–494

    Article  Google Scholar 

  • Miller P. H. (1999) Strong generative capacity: The semantics of linguistic formalism. CSLI Publications, Stanford

    Google Scholar 

  • Mönnich, U. (1997). Adjunction as substitution. In G. J. Kruijff, G. Morill & R. Oehrle (Eds.), Formal grammar ’97 (pp. 169–178).

  • Rogers J. (1998) A descriptive approach to language-theoretic complexity. CSLI Publications, Stanford

    Google Scholar 

  • Rogers J. (2003) wMSO theories as grammar formalisms. Theoretical Computer Science 293(2): 291–320

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Jim Rogers.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kepser, S., Rogers, J. The Equivalence of Tree Adjoining Grammars and Monadic Linear Context-free Tree Grammars. J of Log Lang and Inf 20, 361–384 (2011). https://doi.org/10.1007/s10849-011-9134-0

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10849-011-9134-0

Keywords

Navigation