Score: 0
One-sided Hom shifts
Published: September 29, 2025 |
arXiv ID: 2509.24754v1
By: Marie-Pierre Béal, Alexi Block Gorman
Potential Business Impact:
Lets computers understand patterns in different ways.
Business Areas:
Wireless
Hardware, Mobile
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
Similar Papers
86%
Minimality and computability of languages of G-shifts
Formal Languages and Automata Theory
Makes computer math problems easier to solve.
12 Jun 2025
0
85%
Parametrized complexity of relations between multidimensional subshifts
Dynamical Systems
Helps understand complex patterns in data.
29 Sep 2025
0
84%
Dvorak-Dell-Grohe-Rattan theorem via an asymptotic argument
Combinatorics
Finds if two pictures are the same.
19 Jul 2025
0
Page Count
28 pages
Category
Computer Science:
Formal Languages and Automata Theory