Computer Science – Logic in Computer Science
Scientific paper
2010-06-29
Computer Science
Logic in Computer Science
Scientific paper
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.
No associations
LandOfFree
Rewriting Preserving Recognizability of Finite Tree Languages does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Rewriting Preserving Recognizability of Finite Tree Languages, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Rewriting Preserving Recognizability of Finite Tree Languages will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-314153