Back to Search
Start Over
Remarks on Privileged Words
- Publication Year :
- 2013
- Publisher :
- arXiv, 2013.
-
Abstract
- We discuss the notion of privileged word, recently introduced by Peltomaki. A word w is privileged if it is of length =1, then w^j is privileged for all j >= 0; (2) the language of privileged words is neither regular nor context-free; (3) there is a linear-time algorithm to check if a given word is privileged; and (4) there are at least 2^{n-5}/n^2 privileged binary words of length n.
Details
- Database :
- OpenAIRE
- Accession number :
- edsair.doi.dedup.....1accc831afd4544f017ae354af8c49d5
- Full Text :
- https://doi.org/10.48550/arxiv.1311.7403