Words / CONCEPT
The One-Sided Morse-Hedlund Theorem
Low factor complexity forces eventual periodicity for every one-sided word over a finite alphabet.
Closed
DIRECT PREREQUISITES0
DIRECT CONSEQUENCES2
PROOF DEPTH0
DOCUMENT LINKS1
Low factor complexity forces eventual periodicity
RELATIONSHIP ATLAS
Every connection, in context.
Direct recorded relationships
Proof dependencyStructural affinityDocument link
Certified topology / UPSTREAM
Prerequisites
None recorded in this release.
Certified topology / DOWNSTREAM
Consequences
RELATED KNOWLEDGE
Structural connections
- Exact Diameter and Optimal Supports for Green Classesstructural-affinity · Closed
- Minimality of the Golden Word Subshiftstructural-affinity · Closed
- Polynomial Complexity and Subshift Hausdorff Dimensionstructural-affinity · Closed
- The First Hole Is Bounded by the Budget, with Equality for Prefix Namesstructural-affinity · Closed
- The Green Class Has Content-Independent Measure n to the Minus mstructural-affinity · Closed
- Topology and Cardinality of Word Subshiftsstructural-affinity · Closed
- Words: Golden Factor Complexitystructural-affinity · Closed
- Words: Morse Hedlund Conversestructural-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