scientific article; zbMATH DE number 475426
In the paper monoids generated by deterministic root-to-frontier tree transformation classes with composition are considered. A procedure is described, which, given a finite and not too general set \(P\) of such tree transformation classes, yields an algorithm with the following property. For any two elements \(X_ 1\circ\ldots\circ X_ m\) and \(Y_ 1\circ\ldots\circ Y_ n\) of the monoid generated by \(P\) with composition \(\circ\), the algorithm can decide if the inclusion \[ X_ 1\circ\ldots\circ X_ m\subseteq Y_ 1\circ\ldots\circ Y_ n \] holds or not. The procedure is applied to two particular choices of \(P\), namely to the sets \[ M=\{DF,LDF,NDF,LNDF,H,LH,NH\} \] and \[ S=\{DR,LDR,NDR,LNDR,H,LH,NH\} \] where the first set consists of the class of deterministic bottom-up tree transformations and its six fundamental subclasses; and the second one consists of the top-dow counterparts of the elements of the first one. For the entire collection see [Zbl 0781.00007].
- scientific article; zbMATH DE number 223548
- A complete classification of deterministic root-to-frontier tree transformation classes
- A complete description for a monoid of deterministic bottom-up tree transformation classes
- scientific article; zbMATH DE number 522869
- Compositions with superlinear deterministic top-down tree transformations
- Compositions with superlinear deterministic top-down tree transformations
- A complete description for a monoid of deterministic bottom-up tree transformation classes
- Compositions of deterministic bottom-up, top-down, and regular look-ahead tree transformations
- Hierarchies of tree series transformations
- scientific article; zbMATH DE number 4041315 (Why is no real title available?)
- A hierarchy of deterministic top-down tree transformations
- Superlinear deterministic top-down tree transducers
- scientific article; zbMATH DE number 223548 (Why is no real title available?)
- Classes of Tree Homomorphisms with Decidable Preservation of Regularity
- A complete rewriting system for a monoid of tree transformation classes
- The emptiness problem is undecidable for domains of partial monadic 2- modular tree transformations
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4273673)