Factor complexity of infinite words associated with non-simple Parry numbers.
Klouda, Karel ; Pelantová, Edita
Integers, Tome 9 (2009), p. 281-309 / Harvested from The Electronic Library of Mathematics
Access to full text
Full (PDF)
Publié le : 2009-01-01
DOI : https://doi.org/10.1515/INTEG.2009.025
EUDML-ID : urn:eudml:doc:117736 
@article{05617056,
     title = {Factor complexity of infinite words associated with non-simple Parry numbers.},
     journal = {Integers},
     volume = {9},
     year = {2009},
     pages = {281-309},
     doi = {10.1515/INTEG.2009.025},
     zbl = {1193.68201},
     language = {en},
     url = {http://dml.mathdoc.fr/item/05617056}
}

Klouda, Karel; Pelantová, Edita. Factor complexity of infinite words associated with non-simple Parry numbers.. Integers, Tome 9 (2009) pp. 281-309. doi : 10.1515/INTEG.2009.025. http://gdmltest.u-ga.fr/item/05617056/