Real-Time Prime Generators Implemented on Small-State Cellular Automata
From MaRDI portal
Publication:4983004
DOI10.1007/978-3-319-09039-9_15zbMATH Open1327.68167OpenAlexW143873206MaRDI QIDQ4983004FDOQ4983004
Authors: Kunio Miyamoto, Yasuyuki Abe, Hiroshi Umeo
Publication date: 14 April 2015
Published in: Automata, Universality, Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-09039-9_15
Recommendations
- scientific article; zbMATH DE number 2113950
- scientific article; zbMATH DE number 1361494
- scientific article; zbMATH DE number 1948511
- 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
- Problem solving on one-bit-communication cellular automata
- One-way bounded cellular automata
- On optimal solutions to the firing squad synchronization problem
- Signals in one-dimensional cellular automata
- Real-time language recognition by one-dimensional cellular automata
- Title not available (Why is that?)
- Title not available (Why is that?)
- Generation of Primes by a One-Dimensional Real-Time Iterative Array
- Title not available (Why is that?)
Cited In (4)
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)