I'm trying to construct a truth table from a finite state machine of flags in a NASCAR race.Flag meanings: green=start yellow=caution red=stop black=get off white=one lap left checkered=finish lineIn an example with a stoplight in class, the variable that makes the current state go to the next state on the stoplight is a timer. So the truth table looked like this:Timer    current state    next state0            red              red1            red              green0            green            green1            green            yellowetc...For a NASCAR Flag FSM would the variable be whatever is causing it to go to next state, since there isn't a timer involved(?)? For example, would this be correct?variable      current state            next statecrash             green                     yellowstop race         green                     redget off track     green                     black1 lap left        green                     whiterace over         white                     checkered
What would the truth table for a finite state machine showing transitions of flags in a nascar race look like?
finite automata