Jump to content

Continuous automaton

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Dysprosia (talk | contribs) at 04:10, 2 July 2005 (merge up). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

A continuous automaton can be described as a cellular automaton whereby the valid states a cell can take are not discrete (for example, the states consist of integers between 0 and 3), but continuous, for example, [0,1]. The cells however remain discretely seperated from each other

Such automata can be used to model certain physical reactions more closely, such as diffusion. One such diffusion model could conceivably consist of a transition function based on the average values of the neighbourhood of the cell. Many implementations of Finite Element Analysis (FEA) can be thought of as continuous automatons, though this degree of abstraction away from the physics of the problem is probably inappropriate.