Automatic sequences generated by synchronizing automata fulfill the Sarnak conjecture
Jean-Marc Deshouillers ; Michael Drmota ; Clemens Müllner
Studia Mathematica, Tome 231 (2015), p. 83-95 / Harvested from The Polish Digital Mathematics Library
Access to full text
Full (PDF)

We prove that automatic sequences generated by synchronizing automata satisfy the full Sarnak conjecture. This is of particular interest, since Berlinkov proved recently that almost all automata are synchronizing.

Publié le : 2015-01-01
EUDML-ID : urn:eudml:doc:285931 
@article{bwmeta1.element.bwnjournal-article-doi-10_4064-sm8479-2-2016,
     author = {Jean-Marc Deshouillers and Michael Drmota and Clemens M\"ullner},
     title = {Automatic sequences generated by synchronizing automata fulfill the Sarnak conjecture},
     journal = {Studia Mathematica},
     volume = {231},
     year = {2015},
     pages = {83-95},
     zbl = {06545411},
     language = {en},
     url = {http://dml.mathdoc.fr/item/bwmeta1.element.bwnjournal-article-doi-10_4064-sm8479-2-2016}
}

Jean-Marc Deshouillers; Michael Drmota; Clemens Müllner. Automatic sequences generated by synchronizing automata fulfill the Sarnak conjecture. Studia Mathematica, Tome 231 (2015) pp. 83-95. http://gdmltest.u-ga.fr/item/bwmeta1.element.bwnjournal-article-doi-10_4064-sm8479-2-2016/