Synchronous solution of the parity problem on cyclic configurations, with elementary cellular automaton rule 150, over a family of directed, non-circulant, regular graphs-Reference-Cited by-同舟云学术

Synchronous solution of the parity problem on cyclic configurations, with elementary cellular automaton rule 150, over a family of directed, non-circulant, regular graphs

Published:2022-11 Issue: Volume:615 Page:578-603
ISSN:0020-0255
Container-title:Information Sciences
language:en
Short-container-title:Information Sciences

Author:

Balbi Pedro Paulo,Ruivo Eurico,Faria Fernando

Publisher

Elsevier BV

Subject

Artificial Intelligence,Information Systems and Management,Computer Science Applications,Theoretical Computer Science,Control and Systems Engineering,Software

Reference19 articles.

1. Solving the parity problem in one-dimensional cellular automata;Betel;Nat. Comput.,2013

2. On density determination with cellular automata: results, constructions and directions;de Oliveira;J. Cell. Automata,2014

3. Introduction to Automata Theory, Languages, and Computation;Hopcroft,2006

4. Theory of cellular automata: A survey;Kari;Theoret. Comput. Sci.,2005

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Generalisation of a synchronous solution of the parity problem on cyclic configurations over a non-circulant graph;Information Sciences;2024-05

2. No Six-Cell Neighborhood Cellular Automaton Solves the Parity Problem;2024

3. Asynchronous Cellular Systems that Solve the Parity Problem;Lecture Notes in Computer Science;2024

4. A Hybrid Approach for Emergency Supplies Site Selection Optimization: A Case Study of Changchun City Using Cellular Automata and WK-Means Clustering;2023 8th International Conference on Cloud Computing and Big Data Analytics (ICCCBDA);2023-04-26