On the Number of Closed Factors in a Word

DOI10.1007/978-3-319-15579-1_29zbMath1451.68211arXiv1305.6395OpenAlexW2133639698MaRDI QIDQ2799189

Zsuzsanna Lipták, Gabriele Fici, Golnaz Badkobeh

Publication date: 8 April 2016

Published in: Language and Automata Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1305.6395

zbMATH Keywords

combinatorics on wordsrich wordclosed wordbitonic wordcomplete return

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items (10)

The sequence of open and closed prefixes of a Sturmian word ⋮ Closed Ziv-Lempel factorization of the \(m\)-bonacci words ⋮ Closed, palindromic, rich, privileged, trapezoidal, and balanced words in automatic sequences ⋮ Remarks on Privileged Words ⋮ Finite and infinite closed-rich words ⋮ Maximal closed substrings ⋮ Palindromic rich words and run-length encodings ⋮ Off-line and on-line algorithms for closed string factorization ⋮ Efficient Identification of k-Closed Strings ⋮ On closed-rich words

Uses Software

• OEIS

This page was built for publication: On the Number of Closed Factors in a Word