Abstract
A regular generalized hypersubstitutions is a mapping from \(\{f_{i} \mid i \in I \}\) to \(W_{\tau}(X)\) such that for every \(i \in I\), each of the variables \(x_{1},x_{2}, \ldots , x_{n_{i}}\) occur in \(\hat{\sigma}[f_{i}(x_{1}, x_{2},\ldots ,x_{n_{i}})]\). We use the extension of regular generalized hypersubstitutions to define tree transformations which is useful for abstract data type specifications in Theoretical Computer Science. In this paper, we study some algebraic properties of tree transformations.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
