There is a wide variety of representations possible and one can express a given Turing machine program as a sequence of machine tables ( see more at finite state machine, state transition table and control table ), as flowcharts and drakon-charts ( see more at state diagram ), or as a form of rudimentary machine code or assembly code called " sets of quadruples " ( see more at Turing machine ).
