Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Reachability Problem in Non-uniform Cellular Automata   This paper deals with the CREP (Configuration REachability Problem) for
non-uniform cellular automata (CAs). The cells of non-uniform CAs, we have
considered here, can use different Wolfram's rules to generate their next
states. We report an algorithm which decides whether or not a configuration of
a given (non-uniform) cellular automaton is reachable from another
configuration. A characterization tool, named Reachability tree, is used to
develop theories and the decision algorithm for the CREP. Though the worst case
complexity of the algorithm is exponential in time and space, but the average
performance is very good.

36
The categories of this paper are: cmp-lg
28
The categories of this paper are: alg-geom
12
The categories of this paper are: nucl-th
30
The categories of this paper are: q-alg
26
The categories of this paper are: bayes-an
19
The categories of this paper are: eess
25
The categories of this paper are: patt-sol
21
The categories of this paper are: adap-org
23
The categories of this paper are: solv-int
33
The categories of this paper are: plasm-ph
31
The categories of this paper are: ao-sci
5
The categories of this paper are: gr-qc
17
The categories of this paper are: q-fin
10
The categories of this paper are: q-bio
8
The categories of this paper are: hep-ex
0
The categories of this paper are: hep-ph