Initialize machine with given arguments.
An integer indicating how many of the first letters of the word are to be deleted. Must be > 0.
Rules that determine how the tag system moves.
Private
Readonly
deletePrivate
lettersPrivate
Readonly
rulePrivate
stopReturns a tuple representation of this system.
a tuple representation of this machine.
A Turing machine is represented as follows:
Returns currently processing words.
Currently processing words.
Proceeds with this system. This method must be called after TagSystem.start called, or get an error,
Non-negative integer indicating how many steps to advance this system.
One "step" is a sequence of reading the first letter, adding a sequence of letters to the end of a word, and erasing m letters.
Initiates processing for letters.
when a letters does not contain a letter defined by the conversion rules.
Generated using TypeDoc
A object for simulate the tag system.