Asymptotic bounds for the number of closed and privileged words

DOI10.37236/12115MaRDI QIDQ6574384zbMATH OpenFDO

Authors Daniel Gabric

Publication date 18 July 2024

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Combinatorics in computer science (68R05) Prefix, length-variable, comma-free codes (94A45) Asymptotic enumeration (05A16) Combinatorics on words (68R15)

Cites work

• scientific article; zbMATH DE number 2024859 (Why is no real title available?)
• A characterization of subshifts with bounded powers
• A classification of trapezoidal words
• Closed Ziv-Lempel factorization of the \(m\)-bonacci words
• Closed, palindromic, rich, privileged, trapezoidal, and balanced words in automatic sequences
• Enumeration and structure of trapezoidal words
• Improved estimates for the number of privileged words
• Introducing privileged words: privileged complexity of Sturmian words
• Maximal Prefix-Synchronized Codes
• On the number of closed factors in a word
• Open and Closed Prefixes of Sturmian Words
• Open and closed words
• Periodic-like words, periodicity, and boxes
• Periods in strings
• Privileged factors in the Thue-Morse word -- a comparison of privileged words and palindromes
• Remarks on privileged words
• String overlaps, pattern matching, and nontransitive games
• Upper bound for the number of closed and privileged words
• Upper bound for the number of privileged words

This page was built for publication: Asymptotic bounds for the number of closed and privileged words

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6574384)