Growth of Power-Free Languages over Large Alphabets

Growth of Power-Free Languages over Large Alphabets

We study growth properties of power-free languages over finite alphabets. We consider the function α ( k , β ) whose values are the exponential growth rates of β -power-free languages over k -letter alphabets and clarify its asymptotic behaviour. Namely, we prove asymptotic formulas for this functio...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Theory of computing systems 2014-02, Vol.54 (2), p.224-243
1. Verfasser: Shur, Arseny M.
Format: Artikel
Sprache:eng
Schlagworte:
Analysis
Approximation
Asymptotic methods
Computer Science
Language
Programming languages
Studies
Theory of Computation
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:We study growth properties of power-free languages over finite alphabets. We consider the function α ( k , β ) whose values are the exponential growth rates of β -power-free languages over k -letter alphabets and clarify its asymptotic behaviour. Namely, we prove asymptotic formulas for this function for the case β ≥2 and suggest such formulas for the case β
ISSN:1432-4350
1433-0490
DOI:10.1007/s00224-013-9512-x