Back to Search
Start Over
Automatic Sequences of Rank Two
- Publication Year :
- 2021
-
Abstract
- Given a right-infinite word $\bf x$ over a finite alphabet $A$, the rank of $\bf x$ is the size of the smallest set $S$ of words over $A$ such that $\bf x$ can be realized as an infinite concatenation of words in $S$. We show that the property of having rank two is decidable for the class of $k$-automatic words for each integer $k\ge 2$.
Details
- Database :
- arXiv
- Publication Type :
- Report
- Accession number :
- edsarx.2108.05434
- Document Type :
- Working Paper