Rewriting Preserving Recognizability of Finite Tree Languages
arXiv:1006.5516
Abstract
We show that left-linear generalized semi-monadic TRSs effectively preserving recognizability of finite tree languages (are EPRF-TRSs). We show that reachability, joinability, and local confluence are decidable for EPRF-TRSs.