Skip to main content
Log in

Semantics of trees

  • Published:
Mathematical systems theory Aims and scope Submit manuscript

Abstract

We introduce F-structures and investigate interpretations of trees in F-structures. Thus trees are viewed as schemes of computations in F-structures. Every tree is shown to be strongly equivalent to some chain-free tree. This enables us to use the grammatical codings of [2] to define formulas for arbitrary interpreted trees. We also introduce a syntactic way to compute the values of interpreted trees.

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.

Similar content being viewed by others

References

  1. A. Ehrenfeucht and G. Rozenberg, On basic properties of DOS systems and languages,Inform. and Control,47 (1980), 137–153.

    Google Scholar 

  2. A. Ehrenfeucht and G. Rozenberg, Grammatical codes of trees,Discrete Appl. Math.,32 (1991), 103–129.

    Google Scholar 

  3. A. Ehrenfeucht, P. ten Pas, and G. Rozenberg, Properties of grammatical codes of trees, Tech. Report No. RUL-91-07, Department of Computer Science, University of Leiden, 1991. To appear inTheoretical Computer Science.

  4. H. C. M. Kleijn and G. Rozenberg, Context-free like restrictions on selective rewriting,Theoret. Comput. Sci.,16 (1981), 237–269.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ehrenfeucht, A., Rozenberg, G. & Salomaa, K. Semantics of trees. Math. Systems Theory 27, 159–181 (1994). https://doi.org/10.1007/BF01195201

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01195201

Keywords

Navigation