Arithmetical complexity of the language of generic limit sets of cellular automata (Q2689368)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7661814
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Arithmetical complexity of the language of generic limit sets of cellular automata |
scientific article; zbMATH DE number 7661814 |
Statements
Arithmetical complexity of the language of generic limit sets of cellular automata (English)
0 references
10 March 2023
0 references
cellular automata
0 references
generic limit sets
0 references
attractors
0 references
topological dynamical systems
0 references
subshifts
0 references
arithmetical complexity
0 references
0 references
0.8619068264961243
0 references
0.7982817888259888
0 references
0.797735333442688
0 references
0.7953740358352661
0 references
0.7793927192687988
0 references
