Class TuringMachine

A object for simulate the turing machine.

Implements

Constructors

constructor

Properties

acceptState blank halt headPosition initState initialWord nowState ruleset tape

Methods

asTuple clone getConfiguration getInitialWord isAccepted isHalted isStopped proceed start toString

Constructors

constructor

  • new TuringMachine(blank, ruleset, initState, acceptState?): TuringMachine

  • Initialize machine with given arguments.

    Parameters

    • blank: TMSymbol

      A blank symbol. Both ends of the tape are (conceptually) initialized by an infinite sequence of this symbol.

    • ruleset: TMRuleSet

      Rules that determine how the head of the machine moves.

    • initState: TMState

      State of the machine when it starts to move.

    • acceptState: null | TMState = null

      State of the machine when the word is accepted.

    Returns TuringMachine

Properties

Private Readonly acceptState

acceptState: null | TMState

Private Readonly blank

blank: TMSymbol

Private halt

halt: boolean = false

Private headPosition

headPosition: number = 0

Private Readonly initState

initState: TMState

Private initialWord

initialWord: null | TMSymbol[] = null

Private nowState

nowState: null | TMState = null

Private Readonly ruleset

ruleset: TMRuleSet

Private tape

tape: null | TMTape = null

Methods

asTuple

  • asTuple(): {
        acceptState: null | TMState;
        blankSymbol: TMSymbol;
        initState: TMState;
        inputSymbolSet: Set<TMSymbol>;
        ruleset: TMRuleSet;
        stateSet: Set<TMState>;
        symbolSet: Set<TMSymbol>;
    }

  • Returns a tuple representation of this machine.

    Returns {
        acceptState: null | TMState;
        blankSymbol: TMSymbol;
        initState: TMState;
        inputSymbolSet: Set<TMSymbol>;
        ruleset: TMRuleSet;
        stateSet: Set<TMState>;
        symbolSet: Set<TMSymbol>;
    }

    a tuple representation of this machine.

    Remarks

    A Turing machine is represented as follows:

    • stateSet - List of all states this machine uses.
    • symbolSet - List of all symbols this machine uses.
    • blankSymbol - A blank symbol.
    • inputSymbolSet - List of all symbols that can be used for words processed by this machine. (In this implementation, it is exactly the same as symbolSet.)
    • ruleSet - List of rules used by this machine.
    • initState - The state of this machine when it starts.
    • acceptState - The state when this machine accepts a word.

clone

getConfiguration

getInitialWord

isAccepted

  • isAccepted(): boolean

  • Returns whether this machine is in the accepted state.

    Returns boolean

    True if this machine is in the accepted state, false otherwise.

isHalted

  • isHalted(): boolean

  • Returns whether this machine is halted.

    Returns boolean

    True if this machine is halted, false otherwise.

    Remarks

    The machine will stop if TuringMachine.isAccepted is true, but it is not treated as "halt".

isStopped

proceed

  • proceed(step?): void

  • Proceeds with this machine. This method must be called after TuringMachine.start called, or get an error,

    Parameters

    • step: number = 1

      Non-negative integer indicating how many steps to advance this machine.

    Returns void

    Remarks

    One "step" is a series of processes that reads a symbol, changes its state, writes the symbol, and moves the head.

start

toString

  • toString(): string

  • Returns string representation of this machine.

    Returns string

    String representation of this machine.

Settings

Member Visibility

Theme

On This Page

Generated using TypeDoc