1) What do you mean by a:
(b) Regular language
(i) Finite Automaton(FA)
3) prepare down the difference between NFA and DFA.
4) What do you mean by a ε-closure of a state q0?
5) Describe automaton in detail.
6) prepare down the principle of mathematical induction.
7) prepare down four ways of theorem proving and describe them.
8) prepare down the applications of TOC.
9) What do you mean by Transition Diagram?
10) prepare down the properties of Transition Function(δ)
11) Convert NFA to DFA and corresponding NFA iff DFA theorem.