Language.UTM.Syntax

Synopsis

• data TuringMachine = TuringMachine {
  • startState :: State
  • acceptState :: State
  • rejectState :: State
  • blankSymbol :: Symbol
  • inputAlphabet :: [Symbol]
  • transitionFunction :: TransitionFunction
  }
• tapeAlphabet :: TuringMachine -> [Symbol]
• type TransitionFunction = Map (State, Symbol) (State, Symbol, Action)
• data Action
  • = L
  • | R
• data Tape = Tape [Symbol] Symbol [Symbol]
• data Configuration = Configuration State Tape
• type ComputationHistory = [Configuration]
• type Input = [Symbol]
• newtype State = State String
• newtype Symbol = Symbol String
• syms :: String -> [Symbol]
• unsyms :: [Symbol] -> String

Documentation