please answer all parts of this questionSolutionAutomata The

please answer all parts of this question

Solution

Automata Theory is a branch of computer science that deals with designing abstract self-propelled computing devices that follow a predetermined sequence of operations automatically. An automaton with a finite number of states is called a Finite Automaton.

Deterministic Finite Automaton (DFA)
In DFA, for each input symbol, one can determine the state to which the machine will move. Hence, it is called Deterministic Automaton. As it has a finite number of states, the machine is called Deterministic Finite Machine or Deterministic Finite Automaton.

Non-deterministic Finite Machine (NFA)
The transition from a state can be to multiple next states for each input symbol. Hence it is called non-deterministic.

I Will Submit Full Answer Shortly....