Standard

Abelian Properties of Words. / Puzynina, Svetlana.

Combinatorics on Words: 12th International Conference, WORDS 2019, Proceedings. ed. / Robert Mercas; Daniel Reidenbach. Springer Nature, 2019. p. 28-45 (Lecture Notes in Computer Science ; Vol. 11682 ).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review

Harvard

Puzynina, S 2019, Abelian Properties of Words. in R Mercas & D Reidenbach (eds), Combinatorics on Words: 12th International Conference, WORDS 2019, Proceedings. Lecture Notes in Computer Science , vol. 11682 , Springer Nature, pp. 28-45, 12th International Conference on Combinatorics on Words, WORDS 2019, Loughborough, United Kingdom, 9/09/19. https://doi.org/10.1007/978-3-030-28796-2_2

APA

Puzynina, S. (2019). Abelian Properties of Words. In R. Mercas, & D. Reidenbach (Eds.), Combinatorics on Words: 12th International Conference, WORDS 2019, Proceedings (pp. 28-45). (Lecture Notes in Computer Science ; Vol. 11682 ). Springer Nature. https://doi.org/10.1007/978-3-030-28796-2_2

Vancouver

Puzynina S. Abelian Properties of Words. In Mercas R, Reidenbach D, editors, Combinatorics on Words: 12th International Conference, WORDS 2019, Proceedings. Springer Nature. 2019. p. 28-45. (Lecture Notes in Computer Science ). https://doi.org/10.1007/978-3-030-28796-2_2

Author

Puzynina, Svetlana. / Abelian Properties of Words. Combinatorics on Words: 12th International Conference, WORDS 2019, Proceedings. editor / Robert Mercas ; Daniel Reidenbach. Springer Nature, 2019. pp. 28-45 (Lecture Notes in Computer Science ).

BibTeX

@inproceedings{ff2986b318814323bc09bf8b51b2b88c,
title = "Abelian Properties of Words",
abstract = "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.",
keywords = "Abelian properties of infinite words, Subshifts, Words complexity",
author = "Svetlana Puzynina",
note = "Puzynina S. (2019) Abelian Properties of Words. In: Merca{\c s} R., Reidenbach D. (eds) Combinatorics on Words. WORDS 2019. Lecture Notes in Computer Science, vol 11682. Springer, Cham; 12th International Conference on Combinatorics on Words, WORDS 2019 ; Conference date: 09-09-2019 Through 13-09-2019",
year = "2019",
month = jan,
day = "1",
doi = "10.1007/978-3-030-28796-2_2",
language = "English",
isbn = "9783030287955",
series = "Lecture Notes in Computer Science ",
publisher = "Springer Nature",
pages = "28--45",
editor = "Robert Mercas and Daniel Reidenbach",
booktitle = "Combinatorics on Words",
address = "Germany",

}

RIS

TY - GEN

T1 - Abelian Properties of Words

AU - Puzynina, Svetlana

N1 - Puzynina S. (2019) Abelian Properties of Words. In: Mercaş R., Reidenbach D. (eds) Combinatorics on Words. WORDS 2019. Lecture Notes in Computer Science, vol 11682. Springer, Cham

PY - 2019/1/1

Y1 - 2019/1/1

N2 - 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.

AB - 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.

KW - Abelian properties of infinite words

KW - Subshifts

KW - Words complexity

UR - http://www.scopus.com/inward/record.url?scp=85072820878&partnerID=8YFLogxK

U2 - 10.1007/978-3-030-28796-2_2

DO - 10.1007/978-3-030-28796-2_2

M3 - Conference contribution

AN - SCOPUS:85072820878

SN - 9783030287955

T3 - Lecture Notes in Computer Science

SP - 28

EP - 45

BT - Combinatorics on Words

A2 - Mercas, Robert

A2 - Reidenbach, Daniel

PB - Springer Nature

T2 - 12th International Conference on Combinatorics on Words, WORDS 2019

Y2 - 9 September 2019 through 13 September 2019

ER -

ID: 47924059