Cellular Automata and Discrete Geometry
classification
💻 cs.CG
nlin.CG
keywords
automatacellulardiscretealgorithmauthorconstructdevisedfeasible
read the original abstract
In this paper, we look at the possibility to implement the algorithm to construct a discrete line devised by the first author in cellular automata. It turns out that such an implementation is feasible.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.