Given $F{A}_1($with regular expression $r_1)$ and $F{A}_2($with regular expression $r_2),$ a transition table is being put together to build an $FA$ for $r_1+r_2.$

$\backslash$table$[[$New state,Read an a$,$Read an b$],[$##$,z_2,z_3$