Combinatorics / CONCEPT
Automatic Apwenian Sequences with One Odd Letter
Apwenian sequences, period doubling and uniform substitutions define the classification over finite alphabets with one odd letter.
Closed
DIRECT PREREQUISITES0
DIRECT CONSEQUENCES2
PROOF DEPTH0
DOCUMENT LINKS1
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
- DFAO State Lower Boundsstructural-affinity · Closed
- Dyadic Expansion of the Apwenian Recursionstructural-affinity · Closed
- Finite Level Generators for Binary Automatic Apwenian Sequencesstructural-affinity · Closed
- Maximal-Block Evolution in a Uniform Fixed Wordstructural-affinity · Closed
- Substitution Blocks and Parity Identificationstructural-affinity · Closed
- The Initial Parity Patternstructural-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