A complete rewriting system for a monoid of tree transformation classes
From MaRDI portal
Publication:918216
DOI10.1016/0890-5401(90)90054-LzbMath0705.68068OpenAlexW2063929753MaRDI QIDQ918216
Zoltán Fülöp, Sándor Vágvölgyi
Publication date: 1990
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0890-5401(90)90054-l
Free semigroups, generators and relations, word problems (20M05) Grammars and rewriting systems (68Q42) Word problems, etc. in computability and recursion theory (03D40) Thue and Post systems, etc. (03D03)
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 ⋮ A complete description for a monoid of deterministic bottom-up tree transformation classes ⋮ Top-down tree transducers with two-way tree walking look-ahead ⋮ A complete classification of deterministic root-to-frontier tree transformation classes
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Basic tree transducers
- A complete rewriting system for a monoid of tree transformation classes
- Macro tree transducers
- Pushdown machines for the macro tree transducer
- High level tree transducers and iterated pushdown tree transducers
- Systems of reductions
- Attribute grammars and recursive program schemes. I. II
- Morphismes et bimorphismes d'arbres
- A complete description for a monoid of deterministic bottom-up tree transformation classes
- On tree transducers for partial functions
- Top-down tree transducers with deterministic top-down look-ahead
- Generalized sequential machine maps
- Confluent and Other Types of Thue Systems
- Bottom-up and top-down tree transformations— a comparison
- Top-down tree transducers with regular look-ahead
- Composition of top-down and bottom-up tree transductions
- Three hierarchies of transducers
- Mappings and grammars on trees
This page was built for publication: A complete rewriting system for a monoid of tree transformation classes
