2000 character limit reached
On the Morse-Hedlund complexity gap (0903.1627v5)
Published 9 Mar 2009 in cs.FL and cs.DM
Abstract: In 1938, Morse and Hedlund proved that the subword complexity function of an infinite word is either bounded or at least linearly growing. In 1982, Ehrenfeucht and Rozenberg proved that this gap property holds for the subword complexity function of any language. The aim of the present paper is to present a self-contained, compact proof of Ehrenfeucht and Rozenberg's result.
Collections
Sign up for free to add this paper to one or more collections.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.