A complete description for a monoid of deterministic bottom-up tree transformation classes

DOI10.1016/0304-3975(91)90376-DzbMath0741.68077OpenAlexW1993168958MaRDI QIDQ1177164

Zoltán Fülöp

Publication date: 26 June 1992

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(91)90376-d

zbMATH Keywords

tree transformationsword problemsThue system

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42) Word problems, etc. in computability and recursion theory (03D40)

Related Items (6)

Compositions of deterministic bottom-up, top-down, and regular look-ahead tree transformations ⋮ Compositions with superlinear deterministic top-down tree transformations ⋮ A complete rewriting system for a monoid of tree transformation classes ⋮ Top-down tree transducers with two-way tree walking look-ahead ⋮ Hasse diagrams for classes of deterministic bottom-up tree-to-tree-series transformations ⋮ Linear deterministic multi bottom-up tree transducers

Cites Work

• A complete classification of deterministic root-to-frontier tree transformation classes
• A complete rewriting system for a monoid of tree transformation classes
• Composition of top-down and bottom-up tree transductions
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A complete description for a monoid of deterministic bottom-up tree transformation classes