On hardest languages for one-dimensional cellular automata (Q6186307)
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: On hardest languages for one-dimensional cellular automata |
scientific article; zbMATH DE number 7798805
Language | Label | Description | Also known as |
---|---|---|---|
English | On hardest languages for one-dimensional cellular automata |
scientific article; zbMATH DE number 7798805 |
Statements
On hardest languages for one-dimensional cellular automata (English)
0 references
2 February 2024
0 references
cellular automata
0 references
hardest languages
0 references
homomorphisms
0 references
finite transducers
0 references