Uniqueness of Normal Forms is Decidable for Shallow Term Rewrite Systems

Uniqueness of normal forms (UN= ) is an important property of term rewrite systems. UN= is decidable for ground (i.e., variable-free) systems and undecidable in general. Recently it was shown to be decidable for linear, shallow systems. We generalize this previous result and show that this property is decidable for shallow rewrite systems, in contrast to confluence, reachability and other properties, which are all undecidable for flat systems. Our result is also optimal in some sense, since we prove that the UN= property is undecidable for two superclasses of flat systems: left-flat, left-linear systems in which right-hand sides are of depth at most two and right-flat, right-linear systems in which left-hand sides are of depth at most two. Keywords and phrases term rewrite systems, uniqueness of normal forms, decidability, shallow rewrite systems, flat rewrite systems Digital Object Identifier 10.4230/LIPIcs.FSTTCS.2010.284

• Type: Journal
• Year: 2010
• Where: FSTTCS
• Authors: Nicholas Radcliffe, Rakesh M. Verma
• Keywords: FSTTCS 2010, Normal Forms, Rewrite Systems, Software Engineering, Systems