Abstract
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. © 2012 Springer-Verlag.
Cite
CITATION STYLE
Aoto, T., & Ketema, J. (2012). Rational term rewriting revisited: Decidability and confluence. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7562 LNCS, pp. 172–186). https://doi.org/10.1007/978-3-642-33654-6_12
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
