Skip to main contentSkip to search
Episciences
Open Access Journals
Sign in(new window)
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Sign in(new window)
Articles & Issues
All articlesAll accepted articlesAll volumesLast volumeSectionsSpecial issuesAuthors
About
The journalIndexing
Boards
Publish
For authorsEthical charter
Submit
Discrete Mathematics & Theoretical Computer Science logo
Contact
|
Credits
eISSN 1365-8050
|
RSS
|
Atom
Episciences
Documentation
|
Acknowledgements
|
Publishing policy
Accessibility: non-compliant
|
Legal mentions
|
Privacy statement
|
Terms of use
  1. Home > Articles & Issues >
  2. Articles >
  3. On the critical expo ...
Article

On the critical exponent of generalized Thue-Morse words

Alexandre B. Massé (1), Srečko Brlek (1), Amy Glen (1), Sébastien Labbé ORCID (1)
(1) Laboratoire de combinatoire et d'informatique mathématique [Montréal]
Download article
Open on HAL
Imported on
March 26, 2015
Published on
January 1, 2007
Last modified on
March 31, 2025
Volume 9
vol. 9:1
Automata, Logic and Semantics
DOI
10.46298/dmtcs.397
License
https://about.hal.science/hal-authorisation-v1
Natural Sciences and Engineering Research Council of Canada
Indicators
943
Views
1708
Downloads

On the critical exponent of generalized Thue-Morse words

Alexandre B. Massé (1), Srečko Brlek (1), Amy Glen (1), Sébastien Labbé ORCID (1)
(1) Laboratoire de combinatoire et d'informatique mathématique [Montréal]
Abstract
For certain generalized Thue-Morse words t, we compute the critical exponent, i.e., the supremum of the set of rational numbers that are exponents of powers in t, and determine exactly the occurrences of powers realizing it.
Keywords
  • [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]
Cited by

Source: OpenCitations

  • On square factors and critical factors of k-bonacci words on infinite alphabet

    arXiv (Cornell University)

    Authors : N. Ghareghani, P. Sharifani

    Journal reference : Volume 865, 2021, pp. 34-43

    DOI : 10.1016/j.tcs.2021.02.027

  • On minimal critical exponent of balanced sequences

    Theoretical Computer Science

    Authors : L'ubomíra Dvořáková ORCID, Edita Pelantová ORCID, Daniela Opočenská, Arseny M. Shur ORCID

    Journal reference : Volume 922, 2022, pp. 158-169

    DOI : 10.1016/j.tcs.2022.04.021
Preview
Loading PDF preview...