About the number of C^ -words of form wxw
From MaRDI portal
Publication:2481971
DOI10.1016/J.TCS.2007.11.004zbMATH Open1136.68046OpenAlexW2207697069MaRDI QIDQ2481971FDOQ2481971
Authors: Yanyan Li 
Publication date: 15 April 2008
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2007.11.004
Recommendations
- On the number of \(C^{\infty}\)-words of each length
- On a conjecture of powers of \(C^{\infty}\)-words
- The complexity of \(C^{b\omega }\)-words of the form \(\tilde w xw\)
- A note on the complexity of \(C^{\infty }\)-words
- scientific article; zbMATH DE number 800168
- Some properties of \(C^ \infty\)-words with applications
- On the computing of \(C^\infty\)-square words
- scientific article; zbMATH DE number 1087786
- On repeated factors in \(C^\infty\)-words
- Properties of infinite words: recent results
derivativepalindromeKolakoski sequence\(C^\infty \)-words\(C^\omega \)-words\(\Delta \)-operator\(C^{b\omega }\)-words
Cites Work
Cited In (11)
- On repeated factors in \(C^\infty\)-words
- Vertical representation of \(\mathbf{C}^\infty\)-words
- On the number of \(C^{\infty}\)-words of each length
- On the computing of \(C^\infty\)-square words
- On a conjecture of powers of \(C^{\infty}\)-words
- Title not available (Why is that?)
- The complexity of smooth words on 2-letter alphabets
- A note on the complexity of \(C^{\infty }\)-words
- Title not available (Why is that?)
- The complexity of \(C^{b\omega }\)-words of the form \(\tilde w xw\)
- Some properties of \(C^ \infty\)-words with applications
This page was built for publication: About the number of \(C^\infty \)-words of form \(\widetilde wxw \)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2481971)
