A note on the complexity of C^ -words
From MaRDI portal
Publication:708227
DOI10.1016/J.TCS.2010.06.024zbMATH Open1208.68136OpenAlexW2042234960MaRDI QIDQ708227FDOQ708227
Authors: Yunbao Huang, William D. Weakley 
Publication date: 11 October 2010
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2010.06.024
Recommendations
Cites Work
- Title not available (Why is that?)
- On repeated factors in \(C^\infty\)-words
- On the number of \(C^{\infty}\)-words of each length
- A note on differentiable palindromes.
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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
- About the number of \(C^\infty \)-words of form \(\widetilde wxw \)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (8)
- Title not available (Why is that?)
- About the number of \(C^\infty \)-words of form \(\widetilde wxw \)
- On complexity functions of infinite words associated with generalized Dyck languages
- Vertical representation of \(\mathbf{C}^\infty\)-words
- On the number of \(C^{\infty}\)-words of each length
- The complexity of smooth words on 2-letter alphabets
- 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: A note on the complexity of \(C^{\infty }\)-words
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q708227)
