GEOGRAPHIC AUTOMATA RELATIONSHIPS

Relationships between Fixed GA define the structure of geographic space, Whatever are the types of the Fixed GA, the relationship between two of them - F1 and F2 are formally described by means of the pairs (F1, F2). In case of a standard Cellular Automata defined on the rectangular grid, each cell has either four - 'von Neumann neighborhood,' or eight - 'Moore neighborhood' neighbors. Each cell is thus related to either four or eight neighbors. In case of an arbitrarily network each node is related to varying number of connected nodes. In case of plane polygon coverage, each polygon is related to varying number of adjacent polygons.

Relationships between Non-fixed and Fixed GA determine location of the Non-Fixed automata/ Non-fixed automata D related to a Fixed one F is located at F by means of this relationship.

For example, the fact that a given non-fixed HOUSEHOLDER is located in a given fixed HOUSE is expressed by the relationship pair (HOUSEHOLDER, HOUSE) GAS paradigm does not consider direct relationships between non-fixed automata. To be related, each of two HOUSEHOLDERS have to be related to its HOUSE, and these two HOUSES should be related to each other

RELATIONSHIP TRANSITION RULES Relationship Transition Rules (TR) make relationships dynamic; they include the rules of destruction and creation of new relationships. In this way, TR determine AUTOMATA MIGRATIONS For example, when a HOUSEHOLDER D leaves the HOUSE H1 it occupies, the relationship (D, H1) between them is destroyed; when D finds a new HOUSE H2 to occupy, the relationship (D, H2) is constructed. Most of TR rules represent rules of movement. This is characteristic of GAS and distinguishes them within general Automata Systems. Diffusion as well as distant moves have identical description in terms of GAS.