1) What do you mean by a:
(a) String
(b) Regular language
2) Describe:
(i) Finite Automaton(FA)
(ii)Transition diagram
3) Write 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) Write down the principle of mathematical induction.
7) Write down four ways of theorem proving and explain them.
8) Write down the applications of TOC.
9) What do you mean by Transition Diagram?
10) Write down the properties of Transition Function(δ)
11) Convert NFA to DFA and corresponding NFA iff DFA theorem.