Last update: Sun Mar 31 03:12:29 MDT 2019
@Article{Moothathu:2012:EEN, author = "T. K. Subrahmonian Moothathu", title = "{Eulerian} entropy and non-repetitive subword complexity", journal = j-THEOR-COMP-SCI, volume = "420", number = "1", pages = "80--88", day = "24", month = feb, year = "2012", CODEN = "TCSCDI", DOI = "https://doi.org/10.1016/j.tcs.2011.11.013", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Jan 21 09:34:29 MST 2012", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs2010.bib", URL = "http://www.sciencedirect.com/science/article/pii/S0304397511009327", acknowledgement = ack-nhfb, fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", }