 Each arrow is labelled with a possible input symbol, so that, given a specific state and an input symbol, the arrow points at the next state.One way of representing such a graph is by means of a set of adjacency matrices, with one matrix for each input symbol.In this case, the list of possible DFA states is written as a column vector.