A note on decidability of cellularity
Formal Languages and Automata Theory
2010-04-13 v1
Abstract
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.
Cite
@article{arxiv.1004.1946,
title = {A note on decidability of cellularity},
author = {Udayan B. Darji and Steve W. Seif},
journal= {arXiv preprint arXiv:1004.1946},
year = {2010}
}