The reachability problem for finite cellular automata (Q674292)
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: The reachability problem for finite cellular automata |
scientific article; zbMATH DE number 986047
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The reachability problem for finite cellular automata |
scientific article; zbMATH DE number 986047 |
Statements
The reachability problem for finite cellular automata (English)
0 references
28 February 1997
0 references
Computational complexity
0 references
Cellular automata
0 references
Reachability problems
0 references
Interactive proofs
0 references
0.8478899598121643
0 references
0.8025016188621521
0 references
0.7771270275115967
0 references
