Upper bound for the number of privileged words
From MaRDI portal
Publication:2092391
DOI10.1016/J.DISC.2022.113164OpenAlexW4294883796MaRDI QIDQ2092391
Publication date: 2 November 2022
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2205.12909
Selfadjoint operator algebras ((C^*)-algebras, von Neumann ((W^*)-) algebras, etc.) (46Lxx) Discrete mathematics in relation to computer science (68Rxx) Topological dynamics (37Bxx)
Cites Work
- Introducing privileged words: privileged complexity of Sturmian words
- A characterization of subshifts with bounded powers
- Upper bound for the number of closed and privileged words
- Closed, palindromic, rich, privileged, trapezoidal, and balanced words in automatic sequences
- Remarks on Privileged Words
- Improved estimates for the number of privileged words
This page was built for publication: Upper bound for the number of privileged words