Stable structure (cellular automat)
In a cellular Automate, a finished reason is called stable structure if it does not change from one generation to another.
Examples
The Jeu of the life gives many examples of stable structures:
| Random links: | Claude Amoz | Beaumarchés | Stalemates of Regina | Chapter house | Battle of Cumes | Timothy_occidental |