@inproceedings{adfc0cc493a847b68e6124524fd23e18,

title = "The Spectra of Words",

abstract = "The k-spectrum of a word is the multiset of its non-contiguous subwords of length k. For given k, how small can n be for a pair of different words of length n to exist, with equal k- spectra? From the Thue-Morse word we find that n is at most 2k . The construction of this paper decreases this upper bound to θk , where ≏ is the golden ratio; the construction was found, though not published, over thirty years ago. Recently the bound has been further reduced, but remains considerably greater than the greatest known lower bound.",

author = "Robin Milner",

year = "2005",

doi = "10.1007/11601548_1",

language = "English",

isbn = "978-3-540-30911-6",

volume = "3838",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "1--5",

editor = "Aart Middeldorp and Vincent Oostrom and Femke Raamsdonk and Roel Vrijer",

booktitle = "Processes, Terms and Cycles: Steps on the Road to Infinity",

address = "United Kingdom",

}