On B. Moss\'e's unilateral recognizability theorem

TL;DR

This paper completes the proof of B. Mossé's unilateral recognizability theorem and introduces an algorithm to determine when a primitive substitution is not recognizable.

Contribution

It finalizes the proof of Mossé's theorem and provides a practical algorithm for non-recognizability decision.

Findings

Complete proof of Mossé's unilateral recognizability theorem.

Algorithm for deciding non-recognizability of primitive substitutions.

Abstract

We complete statement and proof for B. Moss\'e's unilateral recognizability theorem. We also provide an algorithm for deciding the unilateral non-recognizability of a given primitive substitution.