A complete classification of deterministic root-to-frontier tree transformation classes
A root-to-frontier tree transducer is a finite-state automaton which transforms trees (terms) into trees by processing the input tree from the root towards the leaves. The class of all tree transformations (TTs) definable by such transducers is denoted by \({\mathcal R}\). Some of the natural restrictions imposed on transducers are determinism (\({\mathcal D})\), linearity (\({\mathcal L})\), the property of being nondeleting (\({\mathcal N})\) or of having just one state, in which case the induced TT is a tree homomorphism (\({\mathcal H})\). Any combination of such requirements leads to a special class of TTs; for example, \({\mathcal L}{\mathcal D}{\mathcal R}\) is the class of TTs definable by linear deterministic root-to-frontier tree transducers, and \({\mathcal N}{\mathcal H}\) is the class of nondeleting tree homomorphisms. If \({\mathcal A}\) and \({\mathcal B}\) are two classes of TTs, their composition \({\mathcal A}\circ {\mathcal B}\) is the class of all relational compositions \(\alpha\circ \beta\), where \(\alpha\in {\mathcal A}\) and \(\beta\in {\mathcal B}.\) The authors present a complete inclusion diagram for all compositions which ca be formed starting from the classes \({\mathcal D}{\mathcal R}\), \({\mathcal L}{\mathcal D}{\mathcal R}\), \({\mathcal N}{\mathcal D}{\mathcal R}\), \({\mathcal L}{\mathcal N}{\mathcal D}{\mathcal R}\), \({\mathcal H}\), \({\mathcal N}{\mathcal H}\) and \({\mathcal L}{\mathcal H}\) (\({\mathcal L}{\mathcal N}{\mathcal H}\) is uninteresting in this context). All pairs of incomparable classes, all proper inclusions and all proper hierarchies are shown to be so. For this a great amount of earlier work done in this area is utilized, but also several new results are needed.
- A complete rewriting system for a monoid of tree transformation classes
- Bottom-up and top-down tree transformations— a comparison
- Composition of top-down and bottom-up tree transductions
- Generalized sequential machine maps
- scientific article; zbMATH DE number 4016218 (Why is no real title available?)
- scientific article; zbMATH DE number 4041315 (Why is no real title available?)
- scientific article; zbMATH DE number 4083007 (Why is no real title available?)
- scientific article; zbMATH DE number 4108162 (Why is no real title available?)
- scientific article; zbMATH DE number 3615891 (Why is no real title available?)
- Mappings and grammars on trees
- On tree transducers for partial functions
- Three hierarchies of transducers
- Top-down tree transducers with regular look-ahead
- Tree transducers and tree languages
- 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
- Restricted ground tree transducers
- Iterated relabeling tree transducers
- Linear deterministic multi bottom-up tree transducers
- scientific article; zbMATH DE number 4014056 (Why is no real title available?)
- scientific article; zbMATH DE number 4016218 (Why is no real title available?)
- scientific article; zbMATH DE number 3972226 (Why is no real title available?)
- scientific article; zbMATH DE number 4041315 (Why is no real title available?)
- scientific article; zbMATH DE number 4083007 (Why is no real title available?)
- scientific article; zbMATH DE number 17547 (Why is no real title available?)
- scientific article; zbMATH DE number 475426 (Why is no real title available?)
- scientific article; zbMATH DE number 1127077 (Why is no real title available?)
- scientific article; zbMATH DE number 2169069 (Why is no real title available?)
- scientific article; zbMATH DE number 1456969 (Why is no real title available?)
- First-order tree-to-tree functions
- Hasse diagrams for classes of deterministic bottom-up tree-to-tree-series transformations
- Input strictly local tree transducers
This page was built for publication: A complete classification of deterministic root-to-frontier tree transformation classes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q807029)