One-sided Hom shifts
Formal Languages and Automata Theory
2025-09-30 v1 Dynamical Systems
Abstract
We prove that it is decidable whether a one-sided shift of finite type is conjugate to a one-sided Hom-shift, and whether a tree-shift of finite type is conjugate to a Hom tree-shift. The proof uses Williams's theory for one-sided shifts
Cite
@article{arxiv.2509.24754,
title = {One-sided Hom shifts},
author = {Marie-Pierre Béal and Alexi Block Gorman},
journal= {arXiv preprint arXiv:2509.24754},
year = {2025}
}