Primitive Words and Lyndon Words in Automatic and Linearly Recurrent Sequences

Daniel Goc, Kalle Saari, Jeffrey Shallit. Primitive Words and Lyndon Words in Automatic and Linearly Recurrent Sequences. In Adrian Horia Dediu, Carlos Martín-Vide, Bianca Truthe, editors, Language and Automata Theory and Applications - 7th International Conference, LATA 2013, Bilbao, Spain, April 2-5, 2013. Proceedings. Volume 7810 of Lecture Notes in Computer Science, pages 311-322, Springer, 2013. [doi]

@inproceedings{GocSS13-0,
  title = {Primitive Words and Lyndon Words in Automatic and Linearly Recurrent Sequences},
  author = {Daniel Goc and Kalle Saari and Jeffrey Shallit},
  year = {2013},
  doi = {10.1007/978-3-642-37064-9_28},
  url = {http://dx.doi.org/10.1007/978-3-642-37064-9_28},
  researchr = {https://researchr.org/publication/GocSS13-0},
  cites = {0},
  citedby = {0},
  pages = {311-322},
  booktitle = {Language and Automata Theory and Applications - 7th International Conference, LATA 2013, Bilbao, Spain, April 2-5, 2013. Proceedings},
  editor = {Adrian Horia Dediu and Carlos Martín-Vide and Bianca Truthe},
  volume = {7810},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-642-37063-2},
}