Reference no: EM132963378
Question 1: Consider the set1{A, B }∗ of strings over the symbols A and B. Recall that is the empty string.
Define the relation g on {A, B}∗ × N such that
(, 0)∈g if ( s,n)∈g ( A.s, n × 100 + 12) ∈g
( B.s, n × 1000+ 1 22)∈g
(a) State the condition for g to be function and argue that g is indeed a function.
(b) State the condition for g to be one-to-one and argue that g is indeed one-to-one.
(c) Show that g is total on { A, B }∗.
(d) Show that g is an encoding function for { A, B }∗.
(e) Show that g is a Gödel numbering of { A, B }∗
(f) Use g to give an enumeration of { A, B }∗.
(g) State whether { A, B }∗ is finite or infinite and whether it is countable or uncountable. Justify your answer.
(h) Consider the set { A, B, C }∗ of strings over the symbols A, B and C. Give a Gödel numbering g of { A, B, C }∗ such that for any string s, if s ∈ { A, B } ∗ then g( s) = g (s) .
(i) Is the set { A, B }∗× { A, B, C }∗ enumerable? Justify your answer.
Attachment:- Turing machine.rar