A transition table shows the transitions between states for each input character. Here is a finite automaton and a table that shows its transitions:
The column labeled States shows current states of the automaton, and the characters under the heading Inputs shows the labels of the transitions. The cell at row q0 column 'a' (for example) shows that when the automaton is in state q0, character 'a' causes a transition to state q1.
When there is no transition out of the current state for the given character, the table contains a dash. You can think of this as representing the "reject state." The final column shows that characters other than 'a', 'b', or 'c' immediately lead to the reject state.
From the table, what is the next state if the automaton reads character 'b' while in state q1?