Rule vector graph (RVG) to design linear time algorithm for identifying the invertibility of periodic-boundary three neighborhood cellular automata (Q5396367)
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: Rule vector graph (RVG) to design linear time algorithm for identifying the invertibility of periodic-boundary three neighborhood cellular automata |
scientific article; zbMATH DE number 6255698
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Rule vector graph (RVG) to design linear time algorithm for identifying the invertibility of periodic-boundary three neighborhood cellular automata |
scientific article; zbMATH DE number 6255698 |
Statements
5 February 2014
0 references
uniform CA
0 references
hybrid CA
0 references
periodic boundary CA
0 references
rule vector graph (RVG)
0 references
non-reachable states (NRSs)
0 references
rule min term
0 references
invertible CA
0 references
elemenaty group rules
0 references
0.9298998713493348
0 references
0.8752948045730591
0 references
0.8752943277359009
0 references
0.7755394577980042
0 references
0.7492397427558899
0 references
