加载中…
In 2009, Shur published the following conjecture: Let be a power-free language and let be the set of words of that can be extended to a bi-infinite word respecting the given power-freeness. If then for some word . Let denote an -power free language over an alphabet with letters, where is a positive rational number and is positive integer. We prove the conjecture for the languages , where and .

生成讲解博客的中文版本

生成AI智能校验的中文版本