Pseudorandom pattern generation using 3-state cellular automata

4Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper investigates the potentiality of pseudo-random pattern generation of 1-dimensional 3-state cellular automata (CAs). Here, a pattern represents configuration of a CA of length n. We have identified 805 CAs which have great potentiality to act as pseudorandom pattern generator (PRPG).

Cite

CITATION STYLE

APA

Bhattacharjee, K., Paul, D., & Das, S. (2016). Pseudorandom pattern generation using 3-state cellular automata. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 9863 LNCS, 3–13. https://doi.org/10.1007/978-3-319-44365-2_1

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free