cca

changeset 101:0865e29e319d
merge
author: darkhan
date: Wed, 15 Dec 2010 00:07:43 +0300
parents: b3fb9595fee7 33fea6b97cd3
children: a308291203ea
files: Help/automata_window.png
diffstat: 4 files changed, 5 insertions(+), 5 deletions(-) [+]
[-]

Help/Help.html 10

Help/automata_window.png 0

Help/automaton_window.png 0

Help/window.png 0 Help/Help.html 10 Help/automata_window.png 0 Help/automaton_window.png 0 Help/window.png 0
Help/Help.html 10
Help/automata_window.png 0
     1.1 --- a/Help/Help.html	Wed Dec 15 00:06:46 2010 +0300
     1.2 +++ b/Help/Help.html	Wed Dec 15 00:07:43 2010 +0300
     1.3 @@ -1,7 +1,7 @@
     1.4  <html>
     1.5  	<head>
     1.6  		<title>
     1.7 -			Cyclic cellular automata
     1.8 +			Cyclic cellular automata editor
     1.9  		</title>
    1.10  		<meta http-equv="content-type" content="text/html; charset=windows-1251">
    1.11  		<style type="text/css">
    1.12 @@ -15,13 +15,13 @@
    1.13  	</head>
    1.14  	<body>
    1.15  		<h3 align="center">
    1.16 -			CCA - Cyclic cellular automata
    1.17 +			CCA - Cyclic cellular automata editor
    1.18  		<h3>
    1.19  		<h4>
    1.20 -			CCA are cyclic cellular automata creation, editing and visualization tool.
    1.21 +			CCA is cyclic cellular automata creation, editing and visualization tool.
    1.22  		</h4>
    1.23  		<p>
    1.24 -			<b>cellular automaton</b> is a set of cells. Each cell can be in one of several possible states. Cell can change its state, according to state of neighbors of the cell. This process is determined by transition rules. <b>Cyclic cellular automaton</b> is a kind of cellular automaton, its set of states is a cycle, and cell changes its state to next one, according to cycle order. It works with <b>2-dimentional cyclic cellular automaton</b> with rectangular field. Transition rules should be defined through number of neighbors of the cell in same state. This program allows user to change number of cell`s states, order of states and transition rules for each state. Other options are automaton step duration, scale of field, colors of cell in defferent states.
    1.25 +			<b>Cellular automaton</b> is a set of cells. Each cell can be in one of several possible states. Cell can change its state, according to state of neighbors of the cell. This process is determined by transition rules. <b>Cyclic cellular automaton</b> is a kind of cellular automaton, its set of states is a cycle, and cell changes its state to next one, according to cycle order. It works with <b>2-dimentional cyclic cellular automaton</b> with rectangular field. Transition rules should be defined through number of neighbors of the cell in same state. This program allows user to change number of cell`s states, order of states and transition rules for each state. Other options are automaton step duration, scale of field, colors of cell in defferent states.
    1.26  		</p>
    1.27  		<p align="center">
    1.28  			<br><big>Window of the program</big><br><br>
    1.29 @@ -65,7 +65,7 @@
    1.30  		</p>
    1.31  		<p align="center">
    1.32  			<br><big>Automaton window</big><br><br>
    1.33 -			<img src="automata_window.png">
    1.34 +			<img src="automaton_window.png">
    1.35  		</p>
    1.36  		<p>
    1.37  			To set name, key or symbol of state, use entry fields. To set state color, press to the colored area and then choose new color. To set transition rules, use checkboxes. If checkbox with label <b>N</b> is choosen (<b>N</b> = 0, 1, ... 8), then cell in the state will change it, if the cell have <b>N</b> neighbors in same state.