Initialize machine with given arguments.
A blank symbol. Both ends of the tape are (conceptually) initialized by an infinite sequence of this symbol.
Rules that determine how the head of the machine moves.
State of the machine when the word is accepted.
initState is set at ().
Private
Readonly
acceptPrivate
Readonly
blankPrivate
haltPrivate
headPrivate
initPrivate
initialPrivate
nowPrivate
Readonly
rulesetPrivate
tapeReturns a tuple representation of this machine.
a tuple representation of this machine.
A Turing machine is represented as follows:
Returns configuration(current status) of this machine.
Current status of this machine if WriteFirstTuringMachine.start was called, false otherwise.
A turing machine's configuration is represented as follows:
Get the word when this machine starts the process.
Returns the initial-word if WriteFirstTuringMachine.start was called, If not, return null.
Returns whether this machine is halted.
True if this machine is halted, false otherwise.
The machine will stop if WriteFirstTuringMachine.isAccepted is true, but it is not treated as "halt".
Proceeds with this machine. This method must be called after WriteFirstTuringMachine.start called, or get an error,
Non-negative integer indicating how many steps to advance this machine.
One "step" is a series of processes that writes the symbol, moves the head, reads a symbol, and changes its state.
Initiates processing for a given word.
the Write-First TM's input. It' an array that contains the following elements:
Generated using TypeDoc
A object for simulate the turing machine, but the machine will write symbol before read the tape.