1 problem
- 0 votes0 replies0 views
Termination of the balanced pair algorithm under rewriting
Let be a Pisot substitution on letters. Let be a rewriting of such that, for some letters in the rewritten alphabet,…
Termination of the balanced pair algorithm under rewriting
Let be a Pisot substitution on letters. Let be a rewriting of such that, for some letters in the rewritten alphabet,…