Automata

Navigation page for Blueprint/D5/S0/Automata/ at upstream snapshot c1e1716ef741bf4822ce02313bbd7922b2bfd763.

Contents

• Binary Zeckendorf First-Return Skeleton
• Binary Zeckendorf Block Codes and Transient Signatures
• The Exact Binary Base Language
• Bounded State Sample Compactness
• DFAO State Lower Bounds
• Rigid Distinguishing Family Cardinality Bound
• Finite arithmetic kernels and finite output automata
• Finite Partial-Signature Completion
• Finite Sample Restriction
• Finite Sample Skeleton Totalization and Capacity Padding
• Typed DFAO Identification Colorings
• Labeled Prefix Occurrences
• Prefix Coloring Soundness
• Promise Colorings and Total Output Automata
• A non-Mersenne exception to the Rule 30/22 sign pattern
• Recurrent-State Conjugacy of First-Return Skeletons
• Sparse continuation agreement need not be transitive
• Two-State Short-Word Certificate Width
• Two-State Short-Word Sample Bound
• Reachability Cardinality in Binary Typed DFAOs
• Typed Partial DFAO
• Typed Partial DFAOs over a Numeration Base
• Typed Sparse-Sample Identification