Abelian properties of words is a widely studied field in combinatorics on words. Two finite words are abelian equivalent if for each letter they contain the same numbers of occurrences of this letter. In this paper, we give a short overview of some directions of research on abelian properties of words, and discuss in more detail two new problems: small abelian complexity of two-dimensional words, and abelian subshifts.

Original languageEnglish
Title of host publicationCombinatorics on Words
Subtitle of host publication12th International Conference, WORDS 2019, Proceedings
EditorsRobert Mercas, Daniel Reidenbach
PublisherSpringer Nature
Pages28-45
ISBN (Print)9783030287955
DOIs
StatePublished - 1 Jan 2019
Event12th International Conference on Combinatorics on Words, WORDS 2019 - Loughborough, United Kingdom
Duration: 9 Sep 201913 Sep 2019

Publication series

NameLecture Notes in Computer Science
Volume11682
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference12th International Conference on Combinatorics on Words, WORDS 2019
Country/TerritoryUnited Kingdom
CityLoughborough
Period9/09/1913/09/19

    Research areas

  • Abelian properties of infinite words, Subshifts, Words complexity

    Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

ID: 47924059