REGULAR TREE LANGUAGES AND REWRITE SYSTEMS
Rémy Gilleron, Sophie Tison · Fundamenta Informaticae · 1995
We present a collection of results on regular tree languages and rewrite systems. Moreover we prove the undecidability of the preservation of regularity by rewrite systems. More precisely we prove that it is undecidable whether or not for a set E of