On the Church-Rosser Property of Left-Linear Term Rewriting Systems(Regular Section)
スポンサーリンク
概要
- 論文の詳細を見る
G.Huet (1980) showed that a left-linear termrewriting system (TRS) is Church-Rosser (CR) if P↛Q for every critical pair <P,Q> where P↛Q is a parallel reduction from P to Q. This paper shows that Huet's result can be generalized under the assumption that a subsystem K of TRS R (i.e., K ⊆ R) is CR. That is, we show that R is CR if P↛_k Q for every <P,Q> ⋴ CP(K,R-K) and P↛_R-K・→^*_K・←^*_K Q for every <P,Q> ⋴ CP(R-K,R). Here, CP(R_1,R_2) is the set of critical pairs obtained from some rule of R_1 and one of R_2.
- 社団法人電子情報通信学会の論文
- 2003-01-01
著者
-
Ohta Yoshikatsu
Faculty Of Engineering Mie University
-
Oyamaguchi Michio
Faculty Of Engineering Mie University
関連論文
- The Joinability and Related Decision Problems for Semi-constructor TRSs(計算理論)
- Some Results on the CR property of non-E-overlapping and depth-preserving TRS's(Theory of Rewriting Systems and Its Applications)
- On the Church-Rosser Property of Root-E-overlapping and Strogly Depth-preserving Term Rewriting Systems(Special Issue on Generation Database Technology for Internet, Multimedia and Mobile computing)
- On the Church-Rosser Property of Non-E-overlapping and Strongly Depth-preserving Term Rewriting Systems
- Church-Rosser Property and Unique Normal Form Property of Non-Duplicating Term Rewriting Systems(Theory of Rewriting Systems and Its Applications)
- The Reachability and Joinability Problems for Right-Ground Term-Rewriting Systems
- The Reachability Problem for Quasi-Ground Term Rewriting Systems
- On the Open Problems Concerning Church-Rosser of Left-Linear Term Rewriting Systems(Foundations of Computer Science)
- On the Task Scheduling with Communication Delay
- On the Church-Rosser Property of Left-Linear Term Rewriting Systems(Regular Section)
- The Joinability and Related Decision Problems for Semi-constructor TRSs
- The Joinability and Related Decision Problems for Semi-constructor TRSs