Rewriting preserving recognizability of finite tree languages
We show that left-linear generalized semi-monadicTRSs effectively preserve recognizability of finite tree languages (are EPRF-TRSs). We show that reachability, joinability, and local confluence are decidable for EPRF-TRSs. (c) 2012 Elsevier Inc. All rights reserved.
term rewrite systems tree automata preservation of recognizability