Title :
The theory of ground rewrite systems is decidable
Author :
Dauchet, M. ; Tison, S.
Author_Institution :
LIFL, Univ. of Lille-Flandres-Artois, Villeneuve d´´Ascq, France
Abstract :
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
Keywords :
automata theory; decidability; rewriting systems; trees (mathematics); classic properties; debugging; decidable; specification; theory of ground rewrite systems; tree automata techniques; Algebra; Automata; Calculus; Encoding; Partial response channels; Polynomials; Software debugging; Transducers; Tree graphs;
Conference_Titel :
Logic in Computer Science, 1990. LICS '90, Proceedings., Fifth Annual IEEE Symposium on e
Conference_Location :
Philadelphia, PA
Print_ISBN :
0-8186-2073-0
DOI :
10.1109/LICS.1990.113750
