On ground tree transformations and congruences induced by tree automata.

DOI10.1016/S0304-3975(03)00279-2zbMath1046.68067OpenAlexW2065699939MaRDI QIDQ1401416

Sándor Vágvölgyi

Publication date: 17 August 2003

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

Full work available at URL: https://doi.org/10.1016/s0304-3975(03)00279-2

zbMATH Keywords

Tree automataGround term rewrite systemsGround tree transducers

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A fast algorithm for generating reduced ground rewriting systems from a set of ground equations
• Decidability of the confluence of finite ground term rewrite systems and of other related term rewrite systems
• The Church-Rosser property for ground term-rewriting systems is decidable
• A fast algorithm for constructing a tree automaton recognizing a congruential tree language
• Congruential complements of ground term rewrite systems
• Restricted ground tree transducers
• Derivation trees of ground term rewriting systems.
• Minimal equational representations of recognizable tree languages
• Proof lengths for equational completion
• Shostak's congruence closure as completion
• Tree generating regular systems

This page was built for publication: On ground tree transformations and congruences induced by tree automata.