On the Morse-Hedlund complexity gap - Computer Science > Formal Languages and Automata TheoryReportar como inadecuado




On the Morse-Hedlund complexity gap - Computer Science > Formal Languages and Automata Theory - Descarga este documento en PDF. Documentación en PDF para descargar gratis. Disponible también para leer online.

Abstract: In 1938, Morse and Hedlund proved that the subword complexity function of aninfinite word is either bounded or at least linearly growing. In 1982,Ehrenfeucht and Rozenberg proved that this gap property holds for the subwordcomplexity function of any language. The aim of the present paper is to presenta self-contained, compact proof of Ehrenfeucht and Rozenberg-s result.



Autor: Julien Cassaigne, Francois Nicolas

Fuente: https://arxiv.org/







Documentos relacionados