用程序变换法解Word方程
On Solving Word Equations via Program Transformation
摘要：
本文给出了一个通过特殊化配置WE（R，E）来求解文字方程的实验，其中程序WE可以被看作是一个解释器，用来测试替换R的组合是否产生文字方程E的解。这种解释器的几个变体，当专门使用基本的展开/折叠策略时，能够确定具有重叠变量的多组单词方程的可解性。
英文摘要：
The paper presents an experiment of solving word equations via specialization of a configuration WE(R,E), where the program WE can be considered as an interpreter testing whether a composition of substitutions R produces a solution of a word equation E. Several variants of such interpreters, when specialized using a basic unfold/fold strategy, are able to decide solvability for a number of sets of the word equations with the overlapping variables.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
