Intersection of finitely generated congruences over term algebra

DOI10.1016/S0304-3975(02)00080-4zbMath1028.68075MaRDI QIDQ1399965

Sándor Vágvölgyi

Publication date: 30 July 2003

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

zbMATH Keywords

tree automatonterm algebraground term rewrite systemFinitely generated congruence

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items (1)

Intersection of the reflexive transitive closures of two rewrite relations induced by term rewriting systems

Cites Work

• 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
• An algorithm for finding canonical sets of ground rewrite rules in polynomial time
• Shostak's congruence closure as completion
• Tree generating regular systems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Intersection of finitely generated congruences over term algebra