18 views
Consider the alphabet $\Sigma=\{0,1,2, \ldots, 9, \#\}$, and the language of strings of the form $x \# y \# z$, where $x, y$ and $z$ are strings of digit such that when viewed as numbers, satisfy the equation $x+y=z$. For example, the string $123 \# 45 \# 168$ is in this language because $123+45=168$. Is this language regular? Justify your answer.

1 vote