Words / CONCEPT
Closure and potential tests for paired finite-state runs
Closure and potential tests for paired finite-state runs
Closed
DIRECT PREREQUISITES2
DIRECT CONSEQUENCES1
PROOF DEPTH1
DOCUMENT LINKS1
RELATIONSHIP ATLAS
Every connection, in context.
Direct recorded relationships
Proof dependencyStructural affinityDocument link
Certified topology / UPSTREAM
Prerequisites
Certified topology / DOWNSTREAM
Consequences
RELATED KNOWLEDGE
Structural connections
- A paired-digit endpoint automatonstructural-affinity · Closed
- A product potential bounds every accepted paired chunk wordstructural-affinity · Closed
- Compressed co-accessibility and product potentialsstructural-affinity · Closed
- Integral ranks accumulated on finite chunk runsstructural-affinity · Closed
- Regroup endpoint paths into six-bit chunksstructural-affinity · Closed
- The exact weighted cycle for the Frid digit familystructural-affinity · Closed
- The literal deterministic rank table has width 6, initial state 0, and 99 rowsstructural-affinity · Closed
- The literal reachable product-state table is grouped by endpoint state q and first rank state pstructural-affinity · Closed
- The seventeen literal arrays store all 829 endpoint moves for six-bit chunksstructural-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