2026-10-07T14:09:47Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:24139 2025-11-12T12:33:32Z ddc:004 open_access

A Proof of Shur’s Conjecture on the Growth of Power-Free Languages over Large Alphabets Bui, Vuong Rosenfeld, Matthieu power-free languages large alphabets Shur’s conjecture Dejean’s conjecture We settle a conjecture of Shur on an estimation of the exponential growth rates of the languages of (n/(n-1))-free words and (n/(n-1)) ^+-free words over large alphabets of size k with a correction of order O (1/(k²)). Schloss Dagstuhl – Leibniz-Zentrum für Informatik Vuong Bui and Matthieu Rosenfeld 2025 Is Part Of LIPIcs, Volume 345, 50th International Symposium on Mathematical Foundations of Computer Science (MFCS 2025) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.MFCS.2025.32 urn:nbn:de:0030-drops-241398 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2025.32 eng https://creativecommons.org/licenses/by/4.0/legalcode