A note on decidability of cellularity

Details A note on decidability of cellularity A note on decidability of cellularity

2010-04-12

arxiv.org/abs/1004.1946v1

Computer Science

Formal Languages and Automata Theory

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

A note on decidability of cellularity does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A note on decidability of cellularity, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A note on decidability of cellularity will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-262673