Linear cellular automata, finite automata and Pascalʹs triangle Original Research Article

We address the question whether double sequences produced by one-dimensional linear cellular automata can also be generated by finite automata. A complete solution for binomial coefficients and Lucas′ numbers is given and some partial results for the general case are presented.