Zobrazeno 1 - 1
of 1
pro vyhledávání: '"Aseem Baranwal"'
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol vol. 25:2, Iss Combinatorics (2023)
The (bitwise) complement $\overline{x}$ of a binary word $x$ is obtained by changing each $0$ in $x$ to $1$ and vice versa. An $\textit{antisquare}$ is a nonempty word of the form $x\, \overline{x}$. In this paper, we study infinite binary words that
Externí odkaz:
https://doaj.org/article/3d9f4a915cd44c29b73e8397b2fc2d26
