Rewriting preserving recognizability of finite tree languages☆
Under an Elsevier user license
open archive
Highlights
► The concept of an EPRF-TRS is introduced. ► An EPRF-TRS effectively preserves recognizability of finite tree languages. ► We show that left-linear generalized semi-monadic TRSs are EPRF-TRSs. ► We show that each terminating TRS is an EPRF-TRS. ► We show that reachability, joinability, local confluence are decidable for EPRF-TRSs.
Keywords
Term rewrite systems
Tree automata
Preservation of recognizability
Cited by (0)
- ☆
This research was partially supported by the TÁMOP-4.2.2/08/1/2008-0008 program of the Hungarian National Development Agency.
Copyright © 2012 Elsevier Inc. All rights reserved.