1 paper · 1 filter
Udayan B. Darji, Steve W. Seif
A regular language L is said to be cellular if there exists a 1-dimensional cellular automaton CA such that L is the language consisting of the finite blocks associated with CA. It…