Cellular Automata and Intermediate Reachability Problems

Authors:
K. Sutner
Affiliations:
Computer Science Department, Carnegie Mellon University, Pittsburgh, PA 15213, USA
Venue:
Fundamenta Informaticae - Cellular Automata
Year:
2002

Citing 8
Cited 1

Recursively enumerable sets and degrees

Recursively enumerable sets and degrees
Classifying circular cellular automata

Physica D
Cellular automata, &ohgr;&ohgr;-regular sets, and sofic systems

Discrete Applied Mathematics - Formal language theory
On the computational complexity of finite cellular automata

Journal of Computer and System Sciences
On the classifiability of cellular automata

Theoretical Computer Science
A new kind of science

A new kind of science
Cellular automata and intermediate degrees

Theoretical Computer Science
The constructibility of a configuration in a cellular automaton

Journal of Computer and System Sciences

Almost Periodic Configurations on Linear Cellular Automata

Fundamenta Informaticae - Cellular Automata

Quantified Score

Hi-index	0.00

Visualization

Abstract

We exhibit one-dimensional cellular automata whose reachability and confluence problems have arbitrary r.e. degree of unsolvability.