These tools may generate source code that can be compiled and executed or construct a state transition table for a finite-state machine ( which is plugged into template code for compiling and executing ).
12.
Simultaneous transitions in multiple finite state machines can be shown in what is effectively an n-dimensional state transition table in which pairs of rows map ( sets of ) current states to next states.
13.
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 ).
