Asymptotic bounds for the number of closed and privileged words
From MaRDI portal
Publication:6574384
DOI10.37236/12115MaRDI QIDQ6574384FDOQ6574384
Authors: Daniel Gabric 
Publication date: 18 July 2024
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
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
- Title not available (Why is that?)
- Enumeration and structure of trapezoidal words
- Open and Closed Prefixes of Sturmian Words
- A classification of trapezoidal words
- Introducing privileged words: privileged complexity of Sturmian words
- A characterization of subshifts with bounded powers
- String overlaps, pattern matching, and nontransitive games
- Periods in strings
- Closed, palindromic, rich, privileged, trapezoidal, and balanced words in automatic sequences
- Maximal Prefix-Synchronized Codes
- Periodic-like words, periodicity, and boxes
- On the number of closed factors in a word
- Privileged factors in the Thue-Morse word -- a comparison of privileged words and palindromes
- Remarks on privileged words
- Upper bound for the number of privileged words
- Upper bound for the number of closed and privileged words
- Improved estimates for the number of privileged words
- Open and closed words
- Closed Ziv-Lempel factorization of the \(m\)-bonacci 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)
