Automata / CONCEPT
Rigid Distinguishing Family Cardinality Bound
Rigid distinguishing continuations are bounded by the output alphabet.
Closed
DIRECT PREREQUISITES1
DIRECT CONSEQUENCES0
PROOF DEPTH1
DOCUMENT LINKS1
A rigid distinguishing family injects into the output alphabet
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
- Automatic discrepancy of complementary anti-recurrencesstructural-affinity · Closed
- Bounded State Sample Compactnessstructural-affinity · Closed
- DFAO State Lower Boundsstructural-affinity · Closed
- Finite Level Generators for Binary Automatic Apwenian Sequencesstructural-affinity · Closed
- Finite Sample Restrictionstructural-affinity · Closed
- Prefix Coloring Soundnessstructural-affinity · Closed
- Promise Colorings and Total Output Automatastructural-affinity · Closed
- Sparse continuation agreement need not be transitivestructural-affinity · Closed
- The Minimal Guarded Prime-Product DFAOstructural-affinity · Closed
- Two-State Short-Word Sample Boundstructural-affinity · Closed
- Typed Partial DFAOstructural-affinity · Closed
- Typed Partial DFAOs over a Numeration Basestructural-affinity · Closed
- Typed Sparse-Sample Identificationstructural-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