Combinatorics / CONCEPT
Finite Level Generators for Binary Automatic Apwenian Sequences
Binary automatic apwenian sequences arise as the parity of successive whole levels of one finite sum-equivalent morphism.
Closed
DIRECT PREREQUISITES3
DIRECT CONSEQUENCES0
PROOF DEPTH1
DOCUMENT LINKS1
Every binary automatic apwenian sequence has a level generator
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
- Actual Maximal-Block Descentstructural-affinity · Closed
- Automatic Apwenian Sequences with One Odd Letterstructural-affinity · Closed
- Boundary-Pivot Transportstructural-affinity · Closed
- DFAO State Lower Boundsstructural-affinity · Closed
- Dyadic Expansion of the Apwenian Recursionstructural-affinity · Closed
- Finite Paths and Coefficient Familiesstructural-affinity · Closed
- Finite Sample Restrictionstructural-affinity · Closed
- Maximal-Block Evolution in a Uniform Fixed Wordstructural-affinity · Closed
- Prefix Coloring Soundnessstructural-affinity · Closed
- Rigid Distinguishing Family Cardinality Boundstructural-affinity · Closed
- String attractors of cyclically maximal morphismsstructural-affinity · Closed
- Substitution Blocks and Parity Identificationstructural-affinity · Closed
- The Initial Parity Patternstructural-affinity · Closed
- Typed Partial DFAOstructural-affinity · Closed
- Typed Partial DFAOs over a Numeration Basestructural-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