Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2509.24754 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866916976814718976 |
|---|---|
| author | Béal, Marie-Pierre Gorman, Alexi Block |
| author_facet | Béal, Marie-Pierre Gorman, Alexi Block |
| contents | 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 |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2509_24754 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | One-sided Hom shifts Béal, Marie-Pierre Gorman, Alexi Block Formal Languages and Automata Theory Dynamical Systems F.4.3; G.2.1 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 |
| title | One-sided Hom shifts |
| topic | Formal Languages and Automata Theory Dynamical Systems F.4.3; G.2.1 |
| url | https://arxiv.org/abs/2509.24754 |