Cellular Automation Assignment
Added on 2019-10-12
3 Pages1344 Words258 Views
Your task is to:• researching the purpose and structure of cellular automatathen to use the C or C++ or C# (VS 2013 only) programming language (under Linux or Windows)to build:• a one-dimensional cellular automaton i.e. one which develops in one direction on the screen,(usually downwards)You should undertake this assignment individually i.e. no collusion orplagiarism is acceptable.The pass mark for this resit coursework is 60%.IntroductionGenerally a cellular automaton is a regular grid of cells. Each cell can exist in one of a finitenumber of states. The grid can be in any finite number of dimensions but we are only reallyconcerned with 1- (and possibly 2-) dimensional cellular automata. Time is considered to bediscrete rather than continuous. This means that the whole automaton exists in a single state at agiven time, e.g. at time t=1, and then according to the rules, the automaton changes to another stateat time t=2, and so on. The state of any given cell at time t is a function of the states of a finitenumber of cells (called its neighbourhood) at time t-1. This means that the state of a given cell isdetermined based upon the states of its neighbours in the immediate previous time step. Theseneighbours are a selection of cells relative to the specified cell, and do not change (though the cellitself may be in its neighbourhood, it is not usually considered a neighbour). Every cell has thesame rule for updating, based on the values in this neighbourhood. Each time the rules are appliedto the whole grid a new generation is created.Background ReadingWikipedia has a good introduction to CAs at:http://en.wikipedia.org/wiki/Cellular_automataMost popular science books on chaos theory will include a chapter or two on CAs. However a goodbook is ”A New Kind of Science” by Stephen Wolfram (2000) which may be worth dipping into forsome added background - it is available online at:http://www.wolframscience.com/You can find out more about CAs at:http://mathworld.wolfram.com/CellularAutomaton.html
End of preview
Want to access all the pages? Upload your documents or become a member.
Related Documents
Recurrence, Relations (RR) and Cellular Automata (CA)lg...
|5
|930
|207
Python Programming - Assignmentlg...
|2
|548
|217
CS 6041 – Theory of Computation | DFA Model Assignmentlg...
|3
|787
|304