Work

An example of an automatic sequence with non-regular abelian complexity

Year: 2026

Type: preprint

Abstract: Answering a question of Madill and Rampersad, we give an example a of a $2$-automatic sequence whose abelian complexity is not $2$-regular.

Source: arXiv (Cornell University)

DOI: 10.48550/arxiv.2610.03837

Authors: Allouche, Jean-Paul, Rampersad, Narad, Rigo, Michel, Shallit, Jeffrey, Stipulanti, Manon

Institutions: Centre National de la Recherche Scientifique, Institut de Mathématiques de Jussieu-Paris Rive Gauche, The University of Winnipeg, University of Liège, University of Waterloo

Language: English

Topic: semigroups and automata theory

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

Funders: Fonds De La Recherche Scientifique - FNRS, Natural Sciences and Engineering Research Council of Canada

Awards: G3042699701, G5018247653, G67341801

OpenAlex ID: W7220741516

Cites: 1

Cited by:

Related to: 10