In reference to the Chomsky hierarchy (and automatas), Which is the linear feedback shift register Languages/automaton?
It has a finite memory, so it's just a DFA (or some of the output-producing variants). If you allow a growing/shrinking feedback register, it is probably equivalent to a Turing machine.