A1 Refereed original research article in a scientific journal

Asymptotic Abelian Complexities of Certain Morphic Binary Words



Authors: Markus A. Whiteland

Publisher: Institut für Informatik, Justus-Liebig-Universität Giessen

Publication year: 2019

Journal: Journal of Automata, Languages and Combinatorics

Journal acronym: JALC

Volume: 24

Issue: 1

First page : 89

Last page: 114

eISSN: 2567-3785

DOI: https://doi.org/10.25596/jalc-2019-089

Web address : https://www.jalc.de/issues/2019/issue_24_1/jalc-2019-089-114.php

Self-archived copy’s web address: https://research.utu.fi/converis/portal/detail/Publication/39844861


Abstract

We study asymptotic Abelian complexities of morphic binary words. We complete
the classification of upper Abelian complexities of pure morphic binary words initiated
recently by F. Blanchet-Sadri, N. Rampersad, and N. Fox. We also study a class of
morphic binary words having different asymptotic factor complexities despite having
the same asymptotic Abelian complexity.


Downloadable publication

This is an electronic reprint of the original article.
This reprint may differ from the original in pagination and typographic detail. Please cite the original version.


Last updated on 2024-26-11 at 13:40