Documentation

Complexity.Computability.Machines.Turing.MultiTape.Internal.FrameMachines

Shared machines for reading framed words #

These original finite-state machines and run laws preserve all-word behavior, including empty and incomplete frames. Their source is moved unchanged from Encodings.Basic.

The states of a transducer reading a framed word: expecting a marker, expecting a symbol, or past the frame.

Instances For

    Emits the word framed at the start of its input (keep = true), or what follows the frame (keep = false).

    Instances For