This article is within the scope of WikiProject Mathematics, a collaborative effort to improve the coverage of mathematics on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.MathematicsWikipedia:WikiProject MathematicsTemplate:WikiProject Mathematicsmathematics
This article is within the scope of WikiProject Computer science, a collaborative effort to improve the coverage of Computer science related articles on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.Computer scienceWikipedia:WikiProject Computer scienceTemplate:WikiProject Computer scienceComputer science
"the nth term can always be determined by applying a fixed and finite set of rules to the preceding n−1 terms" -- really? I think it's that the n'th term depends on the output of an FSA given the digits of n in some fixed base, and that this is not the same thing. Zarboublian (talk) 12:16, 29 May 2010 (UTC)[reply]
The actual phrase that I removed was "Thue-Morse sequence in base 2". This phrase implies that the Thue-Morse sequence could be expressed in some other base - so you could, for example, have a "Thue-Morse sequence in base 5", and it would be a different sequence from the "Thue-Morse sequence in base 2" (just as the number five is 101 in base 2 but 10 in base 5). This is not true; there is only one Thue-Morse sequence, it is a 2-automatic sequence, but the sequence itself is not expressed in a particular base. Gandalf61 (talk)
Revising article
I have chosen to revise this article as part of a project for a course on automatic sequences. My goal is to make the article easier to read and understand by cleaning up the structure of the article and adding additional details. Please don't be alarmed if you see a large number of changes over the next little while. If you have any concerns, feel free to contact me.
