Can the pseudo-random-sequence generator be described as a finite state automaton?
A finite-state automaton can output an unending sequence of outputs, so you don't need to do anything special.  The regular language will contain all prefixes of possible output streams.

If you really want to consider infinite strings, you could use  Büchi automata to model that. Personally, I don't see the point.