scientific article; zbMATH DE number 4164142

MaRDI QIDQ3490955zbMATH OpenFDO

Authors G. A. Kucherov

Publication date 1989

zbMATH Keywords

reducibilityconfluenceterm rewriting systems

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Parallel algorithms in computer science (68W10)

Cited in

(6)

• Tools for proving inductive equalities, relative completeness, and \(\omega\)-completeness
• Testing for the ground (co-)reducibility property in term-rewriting systems
• Equational problems and disunification
• Proofs in parameterized specifications
• Decidability of confluence and termination of monadic term rewriting systems
• On relationship between term rewriting systems and regular tree languages

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3490955)