Determining a regular language by glider-based structures called phases fi_1 in Rule 110

Details Determining a regular language by glider-based structures called phases fi_1 in Rule 110 Determining a regular language by glider-based structures called phases fi_1 in Rule 110

2007-06-22

arxiv.org/abs/0706.3348v1

Nonlinear Sciences

Cellular Automata and Lattice Gases

by publish in Journal of Cellular Automata

Scientific paper

Rule 110 is a complex elementary cellular automaton able of supporting universal computation and complicated collision-based reactions between gliders. We propose a representation for coding initial conditions by means of a finite subset of regular expressions. The sequences are extracted both from de Bruijn diagrams and tiles specifying a set of phases fi_1 for each glider in Rule 110. The subset of regular expressions is explained in detail.

Affiliated with

Also associated with

No associations

Rating

Determining a regular language by glider-based structures called phases fi_1 in Rule 110 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 Determining a regular language by glider-based structures called phases fi_1 in Rule 110, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Determining a regular language by glider-based structures called phases fi_1 in Rule 110 will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-188011