Marie-Pierre Béal, Dominique Perrin, Antonio Restivo
Published 2021-03-01Version 1
We study the coded systems introduced by Blanchard and Hansel. We give several constructions which allow one to represent a coded system as a strongly unambiguous one.
Related articles:
Constructions of torsion-free countable, amenable, weakly mixing groups
Spaces where all closed sets are $α$-limit sets
On Mixing Rank One Infinite Transformations
![QR code for arXiv:2103.01012 [math.DS]](http://oss.arxitics.com/images/favicon.svg)