Real-Time Prime Generators Implemented on Small-State Cellular Automata
From MaRDI portal
Publication:4983004
Recommendations
- scientific article; zbMATH DE number 2113950
- Real-time generation of primes by a one-dimensional cellular automaton with 11 states
- An infinite prime sequence can be generated in real-time by a 1-bit inter-cell communication cellular automaton
- High-speed pseudorandom sequence generators based on cellular automata
- scientific article; zbMATH DE number 7301769
- On real-time cellular automata and trellis automata
Cites work
- Generation of Primes by a One-Dimensional Real-Time Iterative Array
- scientific article; zbMATH DE number 1886333 (Why is no real title available?)
- scientific article; zbMATH DE number 2113950 (Why is no real title available?)
- On optimal solutions to the firing squad synchronization problem
- One-way bounded cellular automata
- Problem solving on one-bit-communication cellular automata
- Real-time generation of primes by a one-dimensional cellular automaton with 11 states
- Real-time language recognition by one-dimensional cellular automata
- Signals in one-dimensional cellular automata
Cited in
(4)- Real-time generation of primes by a one-dimensional cellular automaton with 11 states
- scientific article; zbMATH DE number 1886333 (Why is no real title available?)
- scientific article; zbMATH DE number 2113950 (Why is no real title available?)
- Millions of 5-State $$n^3$$-Real Time Sequence Generators via Local Simulations
This page was built for publication: Real-Time Prime Generators Implemented on Small-State Cellular Automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4983004)
