Skip to topic | Skip to bottom
Home
Search:
CellularAutomata

CellularAutomata.AcNilipotentr1.1 - 10 Oct 2006 - 22:24 - MathieuSabliktopic end
Start of topic | Skip to actions

AC nilpotent

Définition

$(\mathcal{A}^{\mathbb{Z}},F)$ est nilpotent si il existe $y\in\mathcal{A}^{\mathbb{Z}}$ et $n\in\mathbb{N}$ tels que $F^n(x)=y$ pour tout $x\in\mathcal{A}^{\mathbb{Z}}$.

DynamicClassification

$\mathbf{A}(\mathcal{A}^{\mathbb{Z}},F)=\mathbb{R}$

TopologicalProperties?

ErgodicProperties?

ProblemOfDecidability?

Il est indécidable de savoir si un AC est nilpotent.

PropertiesOfSimulation?


to top
End of topic
Skip to action links | Back to top

Edit | Attach image or document | Printable version | Raw text | More topic actions
Revisions: | r1.1 | Total page history | Backlinks
You are here: CellularAutomata > StrongCombinatoryExamples > AcNilipotent

to top

Copyleft 2005-2009. Tout est libre ici! Everything is free here!
This project is not supported by any grant, organisation,...
Ideas, requests, problems regarding TWiki? Send feedback.