On balanced and abelian properties of circular words over a ternary alphabet

We revisit the problem of extending the notion of a balanced circular word and focus on the case of a ternary alphabet. Basing on the fact that the upper bound for the abelian complexity of balanced ternary words is 3 we provide a classification of all circular words over a ternary alphabet with abe...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Theoretical computer science 2023-01, Vol.939, p.227-236
Hauptverfasser:	Bulgakova, D.V., Buzhinsky, N., Goncharov, Y.O.
Format:	Artikel
Sprache:	eng
Schlagworte:	Abelian complexity Balanced circular words Infinite aperiodic words Life Sciences Ternary circular words
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!