On the Cell-based Complexity of Recognition of Bounded Configurations by Finite Dynamic Cellular Automata

Details On the Cell-based Complexity of Recognition of Bounded Configurations by Finite Dynamic Cellular Automata On the Cell-based Complexity of Recognition of Bounded Configurations by Finite Dynamic Cellular Automata

2002-10-11

arxiv.org/abs/cs/0210009v1

Computer Science

Computational Complexity

11 pages, 1 figure

Scientific paper

This paper studies complexity of recognition of classes of bounded configurations by a generalization of conventional cellular automata (CA) -- finite dynamic cellular automata (FDCA). Inspired by the CA-based models of biological and computer vision, this study attempts to derive the properties of a complexity measure and of the classes of input configurations that make it beneficial to realize the recognition via a two-layered automaton as compared to a one-layered automaton. A formalized model of an image pattern recognition task is utilized to demonstrate that the derived conditions can be satisfied for a non-empty set of practical problems.

Affiliated with

Also associated with

No associations

Rating

On the Cell-based Complexity of Recognition of Bounded Configurations by Finite Dynamic Cellular Automata 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 On the Cell-based Complexity of Recognition of Bounded Configurations by Finite Dynamic Cellular Automata, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the Cell-based Complexity of Recognition of Bounded Configurations by Finite Dynamic Cellular Automata will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-298300