Sébastien Limet, Pierre Réty and Helmut Seidl. Weakly Regular Relations and Applications. In Aart Middeldorp, editor, Rewriting Techniques and Applications, volume 2051 of Lecture Notes in Computer Science, pages 185-200, Utrecht, The Netherlands, May 2001. Springer.
A new class of tree-tuple languages is introduced: the weakly regular relations. It is an extension of the regular case (regular relations) and a restriction of tree-tuple synchronized languages, that has all usual nice properties, except closure under complement. Two applications are presented: to unification modulo a rewrite system, and to one-step rewriting.
Download: PDF Reference: Bibtex The original publication is available at www.springerlink.com