Documentation

Complexitylib.Models.FiniteAutomaton.Complementation.Internal.Encoding

Word encodings preserve the complementation lower bound #

Feed the diagram of each encoded word into OpenAI's order-reversing relation image theorem. Code lengths do not enter the state bound. The existing binary liveness NFA then gives a fixed-alphabet lower bound for the full complement language, and exponential growth rules out a polynomial complementation bound.

Curried form of a binary relation.

Equations
Instances For
    theorem Complexity.FiniteAutomaton.Complementation.Internal.encoded_complement_lower_bound {Alpha : Type} (h : ℕ) (hh : 2 ≤ h) (code : Alphabet h → List Alpha) (s : ℕ) (M : NMachine Alpha s) (hM : ∀ (w : List (Alphabet h)), M.Accepts false (List.flatMap code w) ↔ w ∉ oneWayLiveness h) :
    2 ^ ((h - 2) / 127) ≤ 2 * (s + 1)