We address the question whether double sequences produced by one-dimen
sional linear cellular automata can also be generated by finite automa
ta. A complete solution for binomial coefficients and Lucas' numbers i
s given and some partial results for the general case are presented.