A perfect solution to the parity problem with elementary cellular automaton 150 under asynchronous update
- 1 August 2019
- journal article
- research article
- Published by Elsevier in Information Sciences
- Vol. 493, 138-151
Abstract
No abstract availableKeywords
Funding Information
- CAPES (88887.310281/2018-00)
This publication has 8 references indexed in Scilit:
- A portfolio of classification problems by one-dimensional cellular automata, over cyclic binary configurations and parallel updateNatural Computing, 2017
- Quantitative and logic modelling of molecular and gene networksNature Reviews Genetics, 2015
- Computation of functions on n bits by asynchronous clocking of cellular automataNatural Computing, 2013
- Solving the parity problem in one-dimensional cellular automataNatural Computing, 2013
- Improvement of a Result on Sequencing Elementary Cellular Automata Rules for Solving the Parity ProblemElectronic Notes in Theoretical Computer Science, 2009
- Task‐performing dynamics in irregular, biomimetic networksComplexity, 2007
- Theory of cellular automata: A surveyTheoretical Computer Science, 2005
- Parity problem with a cellular automaton solutionPhysical Review E, 2001