Finite state automata �FSA � have been used to model dynamic systems found in many areas. They are also the building blocks of cellular automata. We present a new scalable divide-and-conquer alogrithm for the parallel simulation of FSAs that is fast and e�cient, regardless of the relation between input size and the number of processors, and discuss its application to sequential circuit and queuing system analysis. 