Last update: Sun Mar 31 03:12:29 MDT 2019
@Article{Masse:2011:PCC, author = "A. Blondin Mass{\'e} and S. Brlek and S. Labb{\'e} and L. Vuillon", title = "Palindromic complexity of codings of rotations", journal = j-THEOR-COMP-SCI, volume = "412", number = "46", pages = "6455--6463", day = "28", month = oct, year = "2011", CODEN = "TCSCDI", DOI = "https://doi.org/10.1016/j.tcs.2011.08.007", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Tue Nov 29 19:11:42 MST 2011", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs2010.bib", URL = "http://www.sciencedirect.com/science/article/pii/S0304397511006682", acknowledgement = ack-nhfb, fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", }