Automata / CONCEPT
Two-State Short-Word Sample Bound
Short-word two-state realizability has an alphabet-linear sample cutoff.
Closed
DIRECT PREREQUISITES1
DIRECT CONSEQUENCES1
PROOF DEPTH2
DOCUMENT LINKS0
A uniform cutoff for partial Boolean labels
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
- Bounded State Sample Compactnessstructural-affinity · Closed
- Finite Sample Restrictionstructural-affinity · Closed
- Prefix Coloring Soundnessstructural-affinity · Closed
- Promise Colorings and Total Output Automatastructural-affinity · Closed
- Rigid Distinguishing Family Cardinality Boundstructural-affinity · Closed
- Sparse continuation agreement need not be transitivestructural-affinity · Closed
- Two-State Short-Word Certificate Widthstructural-affinity · Closed
- Typed Partial DFAOstructural-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