1) Define the following given terms:
a) Alphabets,
b) Strings and
c) Languages.
2) Describe one to one and onto function with the help of an example.
3) Provide the regular expression for L⊆ {0,1}*,the language of all strings of the even length.
4) Specify the pumping lemma for the regular languages.
5) Explain the deterministic pushdown automata.
6) Specify when do you say that the string x is accepted by an PDA.
7) Specify the condition, when the K-tape Turing machine T is said to enumerates the language L.
8) Provide some of the example of non-recursively enumerable languages.
9) Provide an example of the unsolvable problems.
10) Explain the several initial functions.