A perfect solution to the parity problem with elementary cellular automaton 150 under asynchronous update
From MaRDI portal
Publication:2215009
DOI10.1016/J.INS.2019.04.045zbMATH Open1451.68187OpenAlexW2940682283WikidataQ128008470 ScholiaQ128008470MaRDI QIDQ2215009FDOQ2215009
Authors: Eurico L. P. Ruivo, Pedro P. B. de Oliveira 
Publication date: 10 December 2020
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2019.04.045
Recommendations
- scientific article; zbMATH DE number 7339755
- Solving the parity problem in one-dimensional cellular automata
- Improvement of a result on sequencing elementary cellular automata rules for solving the parity problem
- An asynchronous solution to the synchronisation problem for binary one-dimensional cellular automata
- Solving the parity problem with rule 60 in array size of the power of two
Cites Work
- Theory of cellular automata: a survey
- Title not available (Why is that?)
- Computation of functions on \(n\) bits by asynchronous clocking of cellular automata
- Solving the parity problem in one-dimensional cellular automata
- Improvement of a result on sequencing elementary cellular automata rules for solving the parity problem
- Guided tour of asynchronous cellular automata
- On density determination with cellular automata: results, constructions and directions
- Computing modulo-\(n\) by composing cellular automata rules
- Mining a class of decision problems for one-dimensional cellular automata
Cited In (14)
- A tutorial on elementary cellular automata with fully asynchronous updating. General properties and convergence dynamics
- Solving the parity problem in one-dimensional cellular automata
- Asynchronous communicating cellular automata: formalization, robustness and equivalence
- Title not available (Why is that?)
- An asynchronous solution to the synchronisation problem for binary one-dimensional cellular automata
- Asynchronous cellular systems that solve the parity problem
- No six-cell neighborhood cellular automaton solves the parity problem
- Solving the parity problem with rule 60 in array size of the power of two
- A comprehensive taxonomy of cellular automata
- Improvement of a result on sequencing elementary cellular automata rules for solving the parity problem
- Generalisation of a synchronous solution of the parity problem on cyclic configurations over a non-circulant graph
- From multiple to single updates per cell in elementary cellular automata with neighbourhood based priority
- Synchronous solution of the parity problem on cyclic configurations, with elementary cellular automaton rule 150, over a family of directed, non-circulant, regular graphs
- Characterisation of the elementary cellular automata with neighbourhood priority based deterministic updates
This page was built for publication: A perfect solution to the parity problem with elementary cellular automaton 150 under asynchronous update
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2215009)
