Sparse Tiling through Overlap Closures for Termination of String Rewriting
Abstract
We over-approximate reachability sets in string rewriting by languages defined by admissible factors, called tiles. A sparse set of tiles contains only those that are reachable in derivations, and is constructed by completing an automaton. Using the partial algebra defined by a sparse tiling for semantic labelling, we obtain a transformational method for proving local termination. With a known result on forward closures, and a new characterisation of overlap closures, we obtain methods for proving termination and relative termination, respectively. We report on experiments showing the strength of these methods.
- Publication:
-
arXiv e-prints
- Pub Date:
- March 2020
- DOI:
- 10.48550/arXiv.2003.01696
- arXiv:
- arXiv:2003.01696
- Bibcode:
- 2020arXiv200301696G
- Keywords:
-
- Computer Science - Logic in Computer Science