scientific article

zbMath0708.68030MaRDI QIDQ3490955

G. A. Kucherov

Publication date: 1989

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

reducibilityconfluenceterm rewriting systems

Mathematics Subject Classification ID

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

Related Items

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