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.
Similar content being viewed by others
References
A. Ehrenfeucht and G. Rozenberg, On basic properties of DOS systems and languages,Inform. and Control,47 (1980), 137–153.
A. Ehrenfeucht and G. Rozenberg, Grammatical codes of trees,Discrete Appl. Math.,32 (1991), 103–129.
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.
H. C. M. Kleijn and G. Rozenberg, Context-free like restrictions on selective rewriting,Theoret. Comput. Sci.,16 (1981), 237–269.
Author information
Authors and Affiliations
Rights 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
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01195201