arXiv (All)
open access
Random Cellular Automata and deBruijn Graphs
Update rules of a one dimensional Cellular Automaton can be expressed using an edge-labeled deBruijn graph. We explore various questions about the image of a cellular automaton given by a randomly selected update rule by considering a random deBruijn graph.
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Improving pseudorandom generator on cellular automata with bent functions#199441
- Graphes complexes en biologie : problèmes, algorithmes et évaluations#624843
- Detecting Man-in-the-Middle Attacks in Cellular Networks Using Generative Machine Learning Based Indistinguishable Probing#207580
- Defective chromatic polynomials#1118544
- NIEM Naming and Design Rules (NDR) Version 6.0 (2025-08-29)#600710
Record · ID 1446809
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive