Zobrazeno 1 - 2
of 2
pro vyhledávání: '"Arseny Shur"'
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 63, Iss Proc. WORDS 2011, Pp 189-198 (2011)
We prove a Fife-like characterization of the infinite binary (7/3)-power-free words, by giving a finite automaton of 15 states that encodes all such words. As a consequence, we characterize all such words that are 2-automatic.
Externí odkaz:
https://doaj.org/article/530d09a6bb404121ba901f690241d817
Autor:
Arseny Shur
Publikováno v:
International Journal of Foundations of Computer Science. 27:101-102
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8324139d2599fe9eadf8fb54971ace1c
https://doi.org/10.1142/s0129054116020019
https://doi.org/10.1142/s0129054116020019