Complexity of Normal Form Properties and Reductions for Term Rewriting Problems Complexity of Normal Form Properties and Reductions for Term Rewriting Problems

DOI10.3233/FI-2009-0070zbMath1175.68237OpenAlexW1819473958MaRDI QIDQ3635996

Rakesh M. Verma

Publication date: 30 June 2009

Published in: Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3233/fi-2009-0070

zbMATH Keywords

reachabilitydecision problemsterm rewriting systemsuniqueness of normal formsjoinabilityexistence of normal formreductions, confluenceunique normalization

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items (3)

Uniqueness of Normal Forms for Shallow Term Rewrite Systems ⋮ A polynomial algorithm for uniqueness of normal forms of linear shallow term rewrite systems ⋮ Unnamed Item

This page was built for publication: Complexity of Normal Form Properties and Reductions for Term Rewriting Problems Complexity of Normal Form Properties and Reductions for Term Rewriting Problems