Computer Science-AW-Q62

Computer Science-AW-Q62 Online Services

 

EXERCISE 1: TURING MACHINES [33 marks]
 

1. Consider the following Turing Machine M = (Q;; 􀀀;#; ; q0; F), where  = f1; 2; 3g is the input alphabet
and 􀀀 = f1; 2; 3; a; b;#g is the tape alphabet (# is the blank symbol)
 

A transition of the form 1=a;R means that when the head is reading 1, M can legally write a and move right.
(a) Trace the computation ofM on input string 11222233 by completing the following derivation (location of
head is denoted by underlining the respective symbol): [2]
 

q0#11222233# ` q1#11222233# ` q2#a1222233# `



Is the input string accepted?
 
(b) Explain informally, the working of the machine M. [4]
(c) Give the language L(M) in set notation. [3]
 
(d) Provide a grammar having 12 or less rules that accepts the same language as M. What type of grammar [6]
is it?
(e) What properties of formal languages would you use (and how) to formally prove that there is no NFA that [4]
can accept the language L(M). Explain briefly (note: you do not need to actually do any proof).
 
(f) Does there exist a PDA that accepts L(M)? Briefly explain your answer in one short sentence. [3]
(g) We obtain Turing Machine M0 by modifying M as follows: (a) replace transition 3=3;R from state q1 to [3]
q5 with transition b=b;R; and (b) delete loop transition 3=3;R in state q5. Give the language L(M0) in set
notation.
 
2. Show formally, by resorting to problem reduction, that the problem, of deciding whether a Turing machine halts [8]
on an input w where jwj is a multiple of 5, is undecidable.
 

EXERCISE 2: AUTOMATA [37 marks]
 
3. Let M1 = (Q;; 1; q0; F1) be the following finite state automaton defined over the alphabet  = fa; b; c; dg: [18]
 
(a) You are told that the following DFA M2 = (Q2;; 2; q0; F2), built using the subset construction technique,
is a deterministic equivalent version of automaton M1
 
After careful analysis, you realise that M2 is incorrect: it is not a deterministic equivalent version of M1.
Construct a DFA M3 = (Q2;; 3; q0; F3), from M2, by only adding or removing transitions and toggling
whether a state is final or not (but without changing the set of states and the initial state), such that
L(M1) = L(M3). In addition, you are asked ensure that the transition function 3 is total. You do not
need to provide a diagram of M3; just answer the following questions by interpreting transition functions
as relations (e.g., (q0; c; q1) 2 2, since 2(q0; c) = q1)
 

i. What is 3 n 2?
ii. What is 2 n 3?
iii. What is F3 n F2?
iv. What is F2 n F3?
 

You can read more about our case study assignment help services here.
 

 

(b) What modifications are required in M1 in order to make it -free without altering its language? Your
resulting machine M4 = (Q;; 4; q0; F4) will still be non-deterministic. You can only remove  transitions,
add transitions over , or toggle whether a state is final or not, you must not change the set of
states and you cannot change the initial state. You do not need to provide a diagram of M4; just answer
the following questions
 
i. What is 4 n 1?
ii. What is 1 n 4?
iii. What is F4 n F1?
iv. What is F1 n F4?
 
4. Emma’s Pumping Lemma Dilemma: For her job application to tutor CT, Emma has been asked to prove that [4]
L = fanbma2m+3n j m; n  1g is not regular. The night before it was due, she finally finished the proof, wrote
it all down neatly, and went to bed. During the night, burglars came into her house with their dog, and the dog
chewed up her proof. In an attempt to cover their tracks, the burglars tried to recreate the proof. They gathered
all the shreds they could find, but on some of them the ink had washed out from the dog’s saliva, and so they
couldn’t read some parts of it. Can you help them put the proof back together? For each shred they found,
they rewrote it on a piece of paper. If they couldn’t rewrite it, they wrote different interpretations of what they
thought it read onto different pieces of paper. Now they have many pieces of paper, but they don’t know which
of them are correct and in which order they need to go. Help Emma’s burglars.
 
There is one big piece, that reads
 
Reminder: the Pumping lemma states, that for any regular language L, there exists a pumping length
k 2 N, and for all w 2 L, where jwj  k, there exist substrings x; y; z 2 , such that
 

w = xyz (1)
jyj  1 (2)
jxyj  k (3)
xyiz 2 L; for all i  0 (4)
Here are the other pieces they’ve transcribed
 
(a) Now consider w = akbka5k.
(b) Now consider w = abaaaaa.
(c) Thus w = akbka5k = xyz such that jxyj  k and jyj  1.
(d) Then, it follows that w 2 L (where m = n = 1) and jwj = 7  1.
(e) Then, it follows that w 2 L (where m = n = k) and jwj = 7k  k.
(f) Consider now i = 1. Then, xyiz = xyz = aqarasbka5k = aq+r+sbka5k.
(g) Consider now i = 0. Then, xyiz = xy0z = xz = aqasbka5k = aq+sbka5k.
(h) So, it follows that x = a, y = b, and z = aaaaa. Clearly w = abaaaaa = xyz.
(i) Assume that L is regular. Then, there exists a k 2 N as per the Pumping Lemma.
(j) Consider now i = 2. Then, xyiz = xyyz = abbaaaaa. It is then clear that xyiz 62 L.
(k) Now, because q + r + s = k and r  1, we know that q + s 6= k, and therefore, xyiz 62 L.
(l) Thus we have a contradiction: our assumption (that L is regular) must be blue and L is true.
(m) Now, because q + r + s = k and r  1, we know that aqaras = ak, and therefore, xyiz 2 L.
(n) So, according to the Pumping lemma, there exist substrings x; y; z 2  such that (1)-(4) hold.
(o) Thus we have a contradiction: our assumption (that L is regular) must be false and L is not regular.
(p) So, it follows that x = aq; y = ar; z = asbka5k, where q + r  k, r  1, s  0, and q + r + s = k.
 
You need not write out the entire proof, just provide the corresponding letters in the correct order as a word.
For example, the word badf denotes the proof built from statements (b), (a), (d), and (f) in that exact order. And
remember: the burglars wrote down multiple different interpretations of the same piece of the proof, so not all
of these will be necessary or correct. However, all necessary pieces are listed above.
 
5. Prove that L = famb2man j m; n  0g is not regular. [8]
6. Show that the language L2 = fa; bg n famb2man j m; n  0g is not regular. For this part, you can rely on the [4]
fact that L, from the previous question, is not regular.
 
7. Show that the language L3 = fan j n  0; n 6= 3 and n 6= 6g is regular. [3]
EXERCISE 3 [15 marks]
8. Prove mathematically that f(n) = 10n3 + 20n2 + 30 2 O(n4), for n  0. [4]
 
9. Suppose you are studying the computational complexity of a given problem X. It is known that the boolean [4]
satisfiability problem can be reduced to X in polynomial time. In addition, it is known that problem X is in
class PSPACE, as somebody has developed an algorithm for X that is guaranteed to consume no more than
polynomial amount of space. How would you prove that
 
(a) X is NP-COMPLETE.
(b) X is PSPACE-Complete.
 
Observe that you do not need to develop any proof, but just explain briefly what task would you do.
10. Let X1 and X2 be two decision problems. Suppose it is known that X1 is NP-COMPLETE. Suppose further [7]
that there exists an exponential reduction of problem X1 into problem X2, that is, there exists a function f :
X1 ! X2, whose implementation runs in exponential time, such that for any given instance x1 ofX1 the answer
to x1 is “Yes” for problem X1 if and only if the answer to f(x1) is “Yes” for problem X2. What can be said
about the computation complexity of the problem X2. Is X2 NP-HARD? Explain in one or two paragraphs.
EXERCISE 4 [20 marks]
 
11. Explain the phase transition phenomenon observed in 3-SAT.
You’re expected to submit between 400 and 500 words (excluding references).
Think of it, as if you were hired to write a textbook for Computer Science undergraduates who are taking
Computing Theory.
 
Besides providing enough technical information, your text needs to be enjoyable to read (or else the book will
not sell well!). Make sure you use multiple paragraphs, correct English grammar and spelling, and language of
appropriate formality with an adequate flow.
 
You must not copy and paste a single sentence from the web (this includes Wikipedia). Note that copied
sentences are trivial to identify, so you should re-phrase in your own words whatever you read. You should also
reference the material you used for your research.
 
Finally, we strongly recommend you proof-read your text, reflect on whether the reader (e.g., a fellow student)
would be satisfied with what you wrote and revise accordingly.
 
Product code-Computer Science- AW-Q62
 
Looking for best Computer Science- AW-Q62 online ,please click here