Open and closed words

MaRDI QIDQ4967241zbMATH OpenFDO

Authors Gabriele Fici

Publication date 3 July 2019

Full work available at URL http://bulletin.eatcs.org/index.php/beatcs/article/view/508/497

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Recommendations

• On the number of closed factors in a word
• Open and Closed Prefixes of Sturmian Words
• Closed factorization
• The sequence of open and closed prefixes of a Sturmian word
• Open and closed factors in Arnoux-Rauzy words

Cited in

(16)

• Monogenic e-closed languages and dipolar words
• On closed-rich words
• Closed Ziv-Lempel factorization of the \(m\)-bonacci words
• Longest property-preserved common factor: a new string-processing framework
• Off-line and on-line algorithms for closed string factorization
• The sequence of open and closed prefixes of a Sturmian word
• Open and closed factors in Arnoux-Rauzy words
• On the number of closed factors in a word
• Open and Closed Prefixes of Sturmian Words
• Closed factorization
• Improved estimates for the number of privileged words
• Term Rewriting and Applications
• Maximal closed substrings
• Asymptotic bounds for the number of closed and privileged words
• Finding maximal closed substrings
• On the closed-rich constant of infinite words

This page was built for publication: Open and closed words

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