Asymptotic bounds for the number of closed and privileged words
type: Item
instance of: scholarly article
title: Asymptotic bounds for the number of closed and privileged words
DOI: 10.37236/12115
author: Daniel Gabric
published in: The Electronic Journal of Combinatorics
publication date: 2024-07-18T00:00:00Z
Mathematics Subject Classification ID: 68R15
Mathematics Subject Classification ID: 05A05
Mathematics Subject Classification ID: 05A16
Mathematics Subject Classification ID: 94A45
Mathematics Subject Classification ID: 68R05
zbMATH DE Number: 7882966
MaRDI profile type: Publication
cites work: On the Number of Closed Factors in a Word
cites work: Enumeration and structure of trapezoidal words
cites work: Periodic-like words, periodicity, and boxes
cites work: Open and Closed Prefixes of Sturmian Words
cites work: A classification of trapezoidal words
cites work: Q4967241
cites work: Remarks on Privileged Words
cites work: Maximal Prefix-Synchronized Codes
cites work: Periods in strings
cites work: String overlaps, pattern matching, and nontransitive games
cites work: Closed Ziv-Lempel factorization of the \(m\)-bonacci words
cites work: A characterization of subshifts with bounded powers
cites work: Improved estimates for the number of privileged words
cites work: Q4443440
cites work: Introducing privileged words: privileged complexity of Sturmian words
cites work: Privileged factors in the Thue-Morse word -- a comparison of privileged words and palindromes
cites work: Upper bound for the number of closed and privileged words
cites work: Upper bound for the number of privileged words
cites work: Closed, palindromic, rich, privileged, trapezoidal, and balanced words in automatic sequences
description: scientific article; zbMATH DE number 7882966