This Demonstration allows you to edit the graphical representation of an automaton by manipulating its transition matrix. Given one of three choices of an alphabet and a number of states (from 2 to 8), the user is presented with a series of buttons (in color) depicting the transition matrix of a randomly chosen automaton of that kind. Each button changes cyclically through each of the possible states or "nothing", allowing you to handle a wider class than finite-state automata (transition graphs). Immediately to the right of the transition matrix there is a column of toggles to define the acceptor states, which are depicted using double circles in the graph. A series of controls are included to adjust the resulting graph.