TY - GEN
T1 - Rational term rewriting revisited
T2 - 6th International Conference on Graph Transformations, ICGT 2012
AU - Aoto, Takahito
AU - Ketema, Jeroen
PY - 2012/10/24
Y1 - 2012/10/24
N2 - We consider a variant of rational term rewriting as first introduced by Corradini et al., i.e., we consider rewriting of (infinite) terms with a finite number of different subterms. Motivated by computability theory, we show a number of decidability results related to the rewrite relation and prove an effective version of a confluence theorem for orthogonal systems.
AB - We consider a variant of rational term rewriting as first introduced by Corradini et al., i.e., we consider rewriting of (infinite) terms with a finite number of different subterms. Motivated by computability theory, we show a number of decidability results related to the rewrite relation and prove an effective version of a confluence theorem for orthogonal systems.
UR - http://www.scopus.com/inward/record.url?scp=84867630053&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84867630053&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-33654-6_12
DO - 10.1007/978-3-642-33654-6_12
M3 - Conference contribution
AN - SCOPUS:84867630053
SN - 9783642336539
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 172
EP - 186
BT - Graph Transformations - 6th International Conference, ICGT 2012, Proceedings
Y2 - 24 September 2012 through 29 September 2012
ER -