Primitive Words and Lyndon Words in Automatic and Linearly Recurrent Sequences. Goc, D., Saari, K., & Shallit, J. In Language and Automata Theory and Applications - 7th International Conference, LATA 2013, Bilbao, Spain, April 2-5, 2013. Proceedings, pages 311–322, 2013.
Primitive Words and Lyndon Words in Automatic and Linearly Recurrent Sequences [link]Paper  doi  bibtex   
@inproceedings{DBLP:conf/lata/GocSS13,
  author    = {Daniel Goc and
               Kalle Saari and
               Jeffrey Shallit},
  title     = {Primitive Words and Lyndon Words in Automatic and Linearly Recurrent
               Sequences},
  booktitle = {Language and Automata Theory and Applications - 7th International
               Conference, {LATA} 2013, Bilbao, Spain, April 2-5, 2013. Proceedings},
  pages     = {311--322},
  year      = {2013},
  crossref  = {DBLP:conf/lata/2013},
  url       = {https://doi.org/10.1007/978-3-642-37064-9\_28},
  doi       = {10.1007/978-3-642-37064-9\_28},
  timestamp = {Wed, 24 May 2017 08:29:26 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/lata/GocSS13},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

Downloads: 0