arXiv (All)
open access
Explorable Parity Automata
We define the class of explorable automata on finite or infinite words. This is a generalization of History-Deterministic (HD) automata, where this time non-deterministic choices can be resolved by building finitely many simultaneous runs instead of just one. We show that recognizing HD parity autom
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
- Gliders on Aperiodic Monotilings: Cellular Automata on the Hat and Spectre#1037262
- Generalized Parity Measurements and Efficient Large Multi-component Cat State Preparation with Quantum Signal Processing#925722
- Symmetric Nonlinear Cellular Automata as Algebraic References for Rule 30#973110
- OpenBlock: Constructive and Verified Content Generation for Adaptive Tile-Matching Games#1036860
- Why Do Conventional World Models Fail to Learn Cellular Automata?#1144571
Record · ID 1011984
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