JCA HomeIssue Contents

A Note on Decidability of Cellularity
Udayan B. Darji and 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 is shown that cellularity of a regular language is decidable using a new characterization of cellular languages formulated by Freiling, Goldstein and Moews and implied by a deep result of Boyle in symbolic dynamics.

1991 Mathematics Subject Classification. 68Q80, 68Q45, 68Q15, 03D15

Keywords: Cellular automata, finite state automata, cellular language, decidable, computational complexity

Full Text (IP)