Abstract
In this article we propose a simple method to estimate the complexity of a finite word written over a finite alphabet. We use the notion of subword complexity (which is equal to the number of different subwords in the word) as a starting point and show the computation difficulties connected with the usage of subword complexity. To avoid them we propose a new simple measure of a word's complexity, which turned out to be not only easy to compute, but also more precise than classical subword complexity.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
