ConceptDynamics / CONCEPT
Original finite-memory directed graphs
The original lower and upper finite-memory source languages are exactly the bilateral labels of a finite directed graph, whose retained paths have the original weighted adjacency expansion.
Closed
DIRECT PREREQUISITES1
DIRECT CONSEQUENCES1
PROOF DEPTH13
DOCUMENT LINKS0
window value
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
- Actual boundaries for Fibonacci completionstructural-affinity · Closed
- Actual boundaries for Fibonacci completionstructural-affinity · Closed
- Actual complete counts and the auxiliary ratestructural-affinity · Closed
- Actual word-weight regrouping and rate abscissastructural-affinity · Closed
- Nondegenerate competing branches and complete storagestructural-affinity · Closed
- Original interior weighted spectral rootsstructural-affinity · Closed
- Original pieces and a fixed competing tailstructural-affinity · Closed
- Original weighted spectral convergence boundarystructural-affinity · Closed
- Reset codebooks on one bilateral realizationstructural-affinity · Closed
- Same-reset weighted factor dictionariesstructural-affinity · Closed
- Weighted pressure of the actual bilateral languagestructural-affinity · Closed
Documents & exposition
None recorded in this release.
Other authored & advisory relationships
None recorded in this release.
LIBRARY / RELEASE VERSIONS
Content history
Loading release versions...
Browse the archiveCertified provenance