To design state diagram for DFA that accepts only in the end 1, we need four states in that machine 13 The machine in FA starts with an initial state and ending with the accepting state. 14 If we would like to design the state digram for DFA that accepts three digits such as 011. we need... one state two states three states four states To design the DFA that begins with 1 and ends with o, we need the following states q1 state for 1, and q2 state for o Only one state for 0 and 1 such as qt state for having not seen any input, q2 state for 1, and last q3 state for None The class NP consists of those problems that are solvable in Non-deterministic polynomial problem. 11 The Turing machine's tape is finite, so the machine accepts limited entry inputs. In a Nondeterministic Turing machine there is multiple accept state and multiple reject state