Documentation

Complexity.Computability.Machines.Turing.MultiTape.Encodings.Frame.Basic

Pure framed words #

The original framing definitions and laws are moved unchanged below encoding-machine capabilities so their machine implementations do not create an import cycle.

Framed words #

Each symbol b of w as [true, b], followed by [false].

Instances For

    The word framed at the start of v, see Turing.MultiTapeTM.frame.

    Instances For

      What follows the frame at the start of v, see Turing.MultiTapeTM.frame.

      Instances For
        @[simp]
        theorem Turing.MultiTapeTM.frame_append_inj {w w' u u' : List Bool} (h : frame w ++ u = frame w' ++ u') :
        w = w' ∧ u = u'

        A framed word followed by another word determines both.