A new decidability technique for ground term rewriting systems with applications

DOI10.1145/1042038.1042042zbMath1367.68156OpenAlexW2050856006MaRDI QIDQ5277717

Rakesh M. Verma, Ara Hayrapetyan

Publication date: 12 July 2017

Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1042038.1042042

zbMATH Keywords

confluencerewritingpumping lemmadecision proceduresstandard formsunique normalization

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items (3)

Levels of undecidability in rewriting ⋮ New Undecidability Results for Properties of Term Rewrite Systems ⋮ Unique Normalization for Shallow TRS

This page was built for publication: A new decidability technique for ground term rewriting systems with applications