Simulation of non-uniform cellular automata by classical cellular automata and its application in embedded systems
From MaRDI portal
Publication:6137466
Recommendations
Cites work
- scientific article; zbMATH DE number 3896307 (Why is no real title available?)
- scientific article; zbMATH DE number 4070321 (Why is no real title available?)
- scientific article; zbMATH DE number 1070886 (Why is no real title available?)
- scientific article; zbMATH DE number 1962850 (Why is no real title available?)
- scientific article; zbMATH DE number 2113946 (Why is no real title available?)
- scientific article; zbMATH DE number 7179993 (Why is no real title available?)
- Cellular automata complexity trade-offs
- Characterization of single cycle CA and its application in pattern classification
- Communication complexity and intrinsic universality in cellular automata
- Group Properties of Cellular Automata and VLSI Applications
- Non-uniform cellular automata: classes, dynamics, and decidability
This page was built for publication: Simulation of non-uniform cellular automata by classical cellular automata and its application in embedded systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6137466)