Deterministic bottom-up tree transducers and ground term rewrite systems

DOI10.1016/j.tcs.2009.02.040zbMath1171.68018OpenAlexW2009459103MaRDI QIDQ1019744

Sándor Vágvölgyi

Publication date: 28 May 2009

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

Full work available at URL: https://doi.org/10.1016/j.tcs.2009.02.040

zbMATH Keywords

bottom-up tree automatonbottom-up tree transducerground term rewrite system

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)

Cites Work

• A fast algorithm for generating reduced ground rewriting systems from a set of ground equations
• Term rewriting restricted to ground terms.
• Congruential complements of ground term rewrite systems
• Minimal equational representations of recognizable tree languages
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Deterministic bottom-up tree transducers and ground term rewrite systems