Consider the alphabet E = ${[abc] : a, b, c \in 0,1,...,9)} $  Example [234], [567],[897] are symbols of the alphabet. For a string $w \in  $  let n(w) denote the number represented by $ w $:  Example for symbol [345], n([345]) = 345.1) Describe a DFA for the language of strings of the form $[x_0y_0z_0][x_1y_1z_1]    [x_ny_nz_n]$ such that$n(x_n...  x_1x_0) + n(y_n...  y_1y_0) = n(z_n...  z_1z_0)$This language corresponds of reading the numbers from right to left and positionby position; this is how we add numbers by hand.Example $[819][606][213]$ is in the language because 268 + 101 =369. How can we describe something like this? $M = (Q, E, d, q_0, F)$ where Q : ? E = ${[abc] : a, b, c \in 0,1,...,9)} $d: ?$q_0 =  $F: ?
How do I describe a DFA?
automata;finite automata