An analysis of equal length cellular automata (ELCA) generating linear rules for applications in distributed computing (Q2814753)
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: An analysis of equal length cellular automata (ELCA) generating linear rules for applications in distributed computing |
scientific article; zbMATH DE number 6596909
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An analysis of equal length cellular automata (ELCA) generating linear rules for applications in distributed computing |
scientific article; zbMATH DE number 6596909 |
Statements
23 June 2016
0 references
distributed computing
0 references
equal length cellular automata
0 references
characteristics matrix
0 references
characteristics polynomial
0 references
ELCA additive rule
0 references
An analysis of equal length cellular automata (ELCA) generating linear rules for applications in distributed computing (English)
0 references
0.7301885485649109
0 references
0.7264259457588196
0 references