using the C language, due in 2 days. The output must be exactly the same as the attached file

20Elementary Cellular AutomataFilename:automataCellular automata are an interesting application of computer science, simulating out processes bycreating local rules on a grid with individual “cells.”Each unit of time, or “generation,” the cellschange based on a set of rules, and the process is repeated on the new cells.The simplest kind of cellular automata are one-dimensional or elementary cellular automata.The idea is that you start with a certain number of cells, each of which can be “dead” or “alive”arranged on a Möbius strip (i.e., it wraps from the end back to the beginning), and during eachgeneration, consider cell and the states of its left neighbor, itself, and its right neighbor to decidethe cell's state for the next step.Being the savvy mathematician, you know that means that forany given cell, there can be 23, or 8, combinations as shown in graphical form below.For each of those 8 combinations, the result can be either on or off as a result, depending on therules of the automata. This means that there are 28, or 256, different elementary cellularautomata, one for each possible result of each possible state.For example, here is one possible rule set, with each triplet of squares representing a state (themiddle cell is the one being considered), and the square below it representing a result, with awhite square being “dead” or “0”, and a black square being “alive” or “1”.For example, here is two generations of an automata using the above rules, starting with a singlecell.

• 1496731855-automata.pdf

ComputerScienceExpert

(11)

Status NEW Posted 06 Jun 2017 06:06 AM My Price 8.00

-----------

Attachments

file 1496731856-Solutions file 2.docx preview (51 words )

H-----------ell-----------o S-----------ir/-----------Mad-----------am ----------- Th-----------ank----------- yo-----------u f-----------or -----------you-----------r i-----------nte-----------res-----------t a-----------nd -----------buy-----------ing----------- my----------- po-----------ste-----------d s-----------olu-----------tio-----------n. -----------Ple-----------ase----------- pi-----------ng -----------me -----------on -----------cha-----------t I----------- am----------- on-----------lin-----------e o-----------r i-----------nbo-----------x m-----------e a----------- me-----------ssa-----------ge -----------I w-----------ill----------- be----------- qu-----------ick-----------ly -----------onl-----------ine----------- an-----------d g-----------ive----------- yo-----------u e-----------xac-----------t f-----------ile----------- an-----------d t-----------he -----------sam-----------e f-----------ile----------- is----------- al-----------so -----------sen-----------t t-----------o y-----------our----------- em-----------ail----------- th-----------at -----------is -----------reg-----------ist-----------ere-----------d o-----------n -----------THI-----------S W-----------EBS-----------ITE-----------. ----------- Th-----------ank----------- yo-----------u -----------

Not Rated(0)

• Buy Answer