Automata / CONCEPT
Typed Partial DFAO
Partial output automata can be typed over a base automaton with exact transition projection and leading-zero invariance.
Closed
DIRECT PREREQUISITES1
DIRECT CONSEQUENCES2
PROOF DEPTH1
DOCUMENT LINKS1
Successful runs project to the base automaton
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
- Accepted words and legal future effectsstructural-affinity · Closed
- Actual finite partial machinesstructural-affinity · Closed
- 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
- Rigid Distinguishing Family Cardinality Boundstructural-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 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