Cellular automata on regular rooted trees (Q2914698)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Cellular automata on regular rooted trees |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Cellular automata on regular rooted trees |
scientific article |
Statements
Cellular Automata on Regular Rooted Trees (English)
0 references
20 September 2012
0 references
free monoid
0 references
sofic tree shift
0 references
unrestricted Rabin automaton
0 references
finite tree automaton
0 references
cellular automaton
0 references
surjectivity problem
0 references
0.9127024412155152
0 references
0.7808427810668945
0 references
0.7795383334159851
0 references
0.7762567400932312
0 references
0.7732115983963013
0 references
