The theory of ground rewrite systems is decidable
Max Dauchet, Sophie Tison · 2002
Using tree automata techniques, it is proven that the theory of ground rewrite systems is decidable. Novel decision procedures are presented for most classic properties of ground rewrite systems. An example is presented to illustrate how these results could be used for specification and debugging.>