Automata / CONCEPT
Reachability Cardinality in Binary Typed DFAOs
In a reachable binary Zeckendorf-typed partial DFAO, every previous-one state has a distinct previous-zero predecessor under input one, hence the previous-one fiber has no more states than the previous-zero fiber.
Closed
DIRECT PREREQUISITES1
DIRECT CONSEQUENCES0
PROOF DEPTH2
DOCUMENT LINKS1
Every reachable previous-one state has a previous-zero predecessor
RELATIONSHIP ATLAS
Every connection, in context.
Direct recorded relationships
Proof dependencyStructural affinityDocument link
Certified topology / UPSTREAM
Prerequisites
Certified topology / DOWNSTREAM
Consequences
None recorded in this release.
RELATED KNOWLEDGE
Structural connections
- Bidirectional Prime-Box Horizonstructural-affinity · Closed
- Binary Zeckendorf Block Codes and Transient Signaturesstructural-affinity · Closed
- Domains of Guarded Translation Wordsstructural-affinity · Closed
- Exact Prime Division Defeats Every Finite Automatonstructural-affinity · Closed
- Golden Base-Four Interval Machinestructural-affinity · Closed
- Golden Base-Four Long-Tail Outputstructural-affinity · Closed
- Labeled Prefix Occurrencesstructural-affinity · Closed
- Prime History Composition and Contextual Equivalencestructural-affinity · Closed
- The Exact Binary Base Languagestructural-affinity · Closed
- Two-Boundary Observation of a Prime Registerstructural-affinity · Closed
- Typed Partial DFAOs over a Numeration Basestructural-affinity · Closed
- Unbounded Arithmetic Error Weight Below Twenty-One Statesstructural-affinity · Closed
Documents & exposition
Other authored & advisory relationships
None recorded in this release.
LIBRARY / RELEASE VERSIONS
Content history
Loading release versions...
Browse the archiveCertified provenance