Computing abelian complexity of binary uniform morphic words (Q2629230): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 11:22, 3 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing abelian complexity of binary uniform morphic words |
scientific article |
Statements
Computing abelian complexity of binary uniform morphic words (English)
0 references
5 July 2016
0 references
formal languages
0 references
abelian complexity
0 references
morphic words
0 references
automatic sequences
0 references
