On Solving Word Equations via Program Transformation
Programming Languages
2021-06-22 v3 Logic in Computer Science
Abstract
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.
Cite
@article{arxiv.2007.12247,
title = {On Solving Word Equations via Program Transformation},
author = {Antonina Nepeivoda},
journal= {arXiv preprint arXiv:2007.12247},
year = {2021}
}
Comments
Another version of this work will be uploaded on arXiv by eptcs