2000 character limit reached
A Class of Countably Covered Two-Dimensional Sofic Shifts
Published 23 Sep 2024 in math.DS and cs.FL | (2409.14967v1)
Abstract: A multidimensional sofic shift is called countably covered if it has an SFT cover containing only countably many configurations. In contrast to the one-dimensional setting, not all countable sofic shifts are countably covered. We study a subclass of countable shift spaces and characterize the countably covered sofic shifts among them.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.