Combinatorics on Words; Factor complexity; Special factors; Morphisms
Abstract :
[en] A classical result states that, when applying a non-erasing morphism to a word, the factor complexity of the image is bounded by the initial factor complexity multiplied by a constant depending on the morphism. However, when looking at the proof, one easily sees that this can be vastly improved. This is the object of this talk in which we exhibit a large family of words for which, when applying a morphism, the factor complexity grows at most by an additive constant.
This website uses cookies to improve user experience. Read more
Save & Close
Accept all
Decline all
Show detailsHide details
Cookie declaration
About cookies
Strictly necessary
Performance
Strictly necessary cookies allow core website functionality such as user login and account management. The website cannot be used properly without strictly necessary cookies.
This cookie is used by Cookie-Script.com service to remember visitor cookie consent preferences. It is necessary for Cookie-Script.com cookie banner to work properly.
Performance cookies are used to see how visitors use the website, eg. analytics cookies. Those cookies cannot be used to directly identify a certain visitor.
Used to store the attribution information, the referrer initially used to visit the website
Cookies are small text files that are placed on your computer by websites that you visit. Websites use cookies to help users navigate efficiently and perform certain functions. Cookies that are required for the website to operate properly are allowed to be set without your permission. All other cookies need to be approved before they can be set in the browser.
You can change your consent to cookie usage at any time on our Privacy Policy page.
