2000 character limit reached
On the Period of a Periodic-Finite-Type Shift
Published 7 Jan 2008 in cs.IT and math.IT | (0801.1060v2)
Abstract: Periodic-finite-type shifts (PFT's) form a class of sofic shifts that strictly contains the class of shifts of finite type (SFT's). In this paper, we investigate how the notion of "period" inherent in the definition of a PFT causes it to differ from an SFT, and how the period influences the properties of a PFT.
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.