Cellular automata between sofic tree shifts (Q393113)
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 6246037
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Cellular automata between sofic tree shifts |
scientific article; zbMATH DE number 6246037 |
Statements
Cellular automata between sofic tree shifts (English)
0 references
16 January 2014
0 references
free monoid
0 references
regular rooted tree
0 references
tree shift
0 references
subshift
0 references
shift of finite type
0 references
sofic shift
0 references
unrestricted Rabin automaton
0 references
cellular automaton
0 references
surjectivity problem
0 references
injectivity problem
0 references
0 references
0 references
0 references
0.90528476
0 references
0.89185846
0 references
0.8818882
0 references
0.87742454
0 references
0.8740529
0 references
0.86886334
0 references
0.86761165
0 references
0.8627178
0 references
0.85870713
0 references
