Research proof index

Planned adjacent-gap characterization for the extracted step adversary. Once IND_CPA_stepAdversary_game_eq_hybridBranch is proved, this is just the one-time analogue of IND_CPA_signedAdvantageReal_eq_lrDiff_half.

The series ∑ f(n)/n · 𝓕ψ(log(n/x)/(2π)) is summable for x ≥ 1.

The language of the concatenation NA that is accepted by M0's accepting states is the language accepted by M0.

The language of the concatenation NA that is accepted by M1's accepting states is the language accepted by M0 concatenated with the language accepted by M1 minus the empty word.

The language accepted by the product NA is the intersection of the languages accepted by the component automata.

The language accepted by the loop NA is the Kleene star of the language accepted by M.