Anzeige
Erschienen in:
2011 | OriginalPaper | Buchkapitel
Enumeration and Decidable Properties of Automatic Sequences
verfasst von : Émilie Charlier, Narad Rampersad, Jeffrey Shallit
Erschienen in: Developments in Language Theory
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
We show that various aspects of
k
-automatic sequences — such as having an unbordered factor of length
n
— are both decidable and effectively enumerable. As a consequence it follows that many related sequences are either
k
-automatic or
k
-regular. These include many sequences previously studied in the literature, such as the recurrence function, the appearance function, and the repetitivity index. We also give a new characterization of the class of
k
-regular sequences. Many results extend to other sequences defined in terms of Pisot numeration systems.