加载中…
2010-06-29
Rewriting Preserving Recognizability of Finite Tree Languages
Sandor vagvolgyi
文献摘要
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.
讨论
0讲解博客
生成讲解博客的中文版本
AI智能校验
生成AI智能校验的中文版本