Langlib

Langlib.Examples.AbnPowMCopy

The balanced-copy language of abnPowM #

Let A = {(a b^n)^m | n,m > 0} and B be the two intersection witnesses abnPowM and abnAbStarPowPredN. Over a fresh three-letter alphabet, define the numerator

{ code(w) # reverse(code(w)) | w ∈ A }

and the denominator { # reverse(code(v)) | v ∈ B }. The separator makes the quotient split unique, so their right quotient is exactly the encoded diagonal intersection.

Indexed-language membership facts live in Langlib.Classes.Indexed.Examples.AbnPowMCopy.

inductive CopyLetter :

Three-letter alphabet used to separate the copied halves.

Instances For
    Equations

    Embed the binary witness alphabet into the copy alphabet.

    Equations
    Instances For

      The numerator of the indexed right-quotient witness.

      Equations
      Instances For

        The explicit quotient is exactly the encoded diagonal intersection.