Synthical logo
Synthical
Your space
Profile
Activity
Favorites
Folders
Feeds
From arXiv

Decidable problems in substitution shifts

In this paper, we investigate the structure of the most general kind of substitution shifts, including non-minimal ones, and allowing erasing morphisms. We prove the decidability of many properties of these morphisms with respect to the shift space generated by iteration, such as aperiodicity, recognizability and (under an additional assumption) irreducibility, or minimality.
Simplify
Updated on April 2, 2024
Copy BibTeX
Version history
Loading PDF…
Loading...
Comments
Summary
There is no AI-powered summary yet, because we do not have a budget to generate summaries for all articles.
1. Buy subscription
We will thank you for helping thousands of people to save their time at the top of the generated summary.
If you buy our subscription, you will be able to summarize multiple articles.
Pay $undefined
≈10 summaries
Pay $undefined
≈60 summaries
2. Share on socials
If this article gets to top-5 in trends, we'll summarize it for free.
Copy link
Content
Summary