QUESTION 1 Provide the formal definitions and construct a DFA that accepts those binary strings that decimal equivalents are not divisible by 3.

Theory that deals with fundamental questions around what problems can and cannot be solved using computation and uses a model of computation to understand the degree to which computers can assist in solving problems. There are three main branches of this subject: automata theory and formal languages, computational complexity theory, and computability theory.