# CS代考 FIT2014 Theory of Computation FINAL EXAM – cscodehelp代写

Faculty of Information Technology Monash University

FIT2014 Theory of Computation FINAL EXAM

2nd Semester 2017

Working Space

Question 1 (4 marks)

Suppose we have propositions A, K and L, with the following meanings.

A: alphaGo is the equal-best Go player in the world.

K: K ̄e Ji ́e is the equal-best Go player in the world.

L: -dol is the equal-best Go player in the world.

Use A, K and L to write a proposition that is True if and only if exactly two of alphaGo, K ̄e Ji ́e and -dol are the equal-best Go players in the world.

For full marks, your proposition should be in Conjunctive Normal Form.

Question 2 (3 marks)

Suppose you have predicates computableByGoedel, computableByChurch, and computableByTuring with the following meanings, where variable F : {a, b}∗ → N ∪ {0} represents an arbitrary function from finite strings over {a, b} to nonnegative integers:

computableByGoedel(F ): computableByChurch(F ): computableByTuring(F ):

the function F is a recursive function, according to ̈del’s definition.

the function F has a lambda expression, in the sense of ’s Lambda Calculus.

the function F is computable.

In the space below, write a statement in predicate logic with the meaning:

Every function that satisfies any one of the three definitions of computability — recursive functions (Go ̈del), lambda calculus (Church), or Turing computabil- ity — also satisfies each of the others.

To do this, you may only use: the above three predicates; quantifiers; logical connectives. (In particular, you may not use set theory symbols such as ⊆, ⊂, ∩, ∪, etc, and in fact they would not help.)

Official use only

Question 3 (6 marks)

Let En be the following Boolean expression in variables x1, x2, . . . , xn: ((···((((¬x1 ∨x2)∧¬x2)∨x3)∧¬x3)···)∨xn)∧¬xn

For example, E1 = ¬x1, and E2 = (¬x1 ∨ x2) ∧ ¬x2. In general, En = (En−1 ∨ xn) ∧ ¬xn. Prove by induction on n that, for all n ≥ 1, the expression En is satisfiable.

Official use only

Question 4 (4 marks)

Write down all strings of length ≤ 6 that match the following regular expression: ε ∪ (ab)∗b(aaa ∪ bb)∗

Official use only

Working Space

Question 5 (4 marks)

Let R be any regular expression.

(a) Give, in terms of R, a regular expression for the language of all strings that can be

divided into two substrings, each of which matches R.

(b) Prove that the language EVEN(R) of all strings that can be divided into any even number of substrings, each of which matches R, is regular.

For example, if R is a ∪ bb, then the string w = aabba can be divided into four substrings a,a,bb,a which each match R. So this w belongs to EVEN(R). The empty string is also in EVEN(R), noting that zero is an even number. But aabb and bbb do not belong to EVEN(R).

Official use only

Question 6 (8 marks)

(a) Convert the following Nondeterministic Finite Automaton (NFA) into an equivalent Deterministic Finite Automaton (FA).

Your FA must be presented by filling in some rows in the following table. You may not need all the rows available.

(b) Give a regular expression for the language accepted by the above NFA.

(You should not need to apply a general automaton-to-regexp conversion algorithm. Just think about what the automaton does. The equivalent FA should help.)

Question 7 (5 marks)

Give an algorithm which takes, as input, a Finite Automaton represented as a table, and finds another Finite Automaton that accepts the same language as the first one and has the minimum number of states among all FAs that accept that language.

A pseudocode description is fine.

Do not try to write your algorithm as a Turing machine.

Official use only

Question 8 (12 marks)

Consider the following Pushdown Automaton (PDA), with input alphabet {a,b,c} and extra stack symbols S and $.

(T4): a,S → c (T1): ε,ε→$ (T2): ε,ε→S

(T5): ε,ε → S (T3): ε,$→ε

(T6): ε,S→b (T7): a,a→ε (T8): b,b→ε (T9): c,c→ε

(a) Show that the single-letter string b is accepted by this PDA, by giving the sequence of transitions that leads to acceptance of b.

Prove the following statement by induction on n:

For all n ≥ 0:

If the PDA is in State 3, the top symbol on the stack is S, and the remaining

input begins with anbcn, then after reading anbcn the PDA is again in State 3 and the stack is the same except that the S on the top has been removed.

Use the names of the transitions, i.e., T 1, T 2, . . ., etc.

(c) Hence prove that, for all n ≥ 0, the string anbcn is accepted by this PDA.

Official use only

Question 9 (13 marks)

Let GOAL be the language generated by the following Context-Free Grammar:

S → gooXal (1) X → ooXa (2) X→ε (3)

GOAL consists of all strings of the form g(oo)nanl, where n ≥ 1. The first few strings in this language, in order of increasing length, are:

gooal, gooooaal, gooooooaaal, . . .

(a) Give a derivation for the string gooooaal.

Each step in your derivation must be labelled, on its right, by the number of the rule used.

(b) Give a parse tree for the same string, gooooaal.

(c) Use the Pumping Lemma for Regular Languages to prove that GOAL is not regular.

Official use only

Question 10 (2 marks)

The Cocke-Younger-Kasami (CYK) algorithm is less efficient than most commonly used parsing algorithms. What is one significant advantage it has over those algorithms?

Question 11

Consider the following Turing machine.

a→b,R b→b,R

Trace the execution of this Turing machine, writing your answer in the spaces provided on the next page.

The lines show the configuration of the Turing machine at the start of each step. For each line, fill in the state and the contents of the tape. On the tape, you should indicate the currently-scanned character by underlining it, and you should show the first blank character as ∆ (but there is no need to show subsequent blank characters).

You should not need all the lines provided.

To get you started, the first line has been filled in already.

At start of step 1:

At start of step 2:

At start of step 3:

At start of step 4:

At start of step 5:

At start of step 6:

At start of step 7:

At start of step 8:

At start of step 9:

At start of step 10:

At start of step 11:

At start of step 12:

Official use only

Question 12 (5 marks)

(a) Name three variations on Turing machines that give the same class of computable functions.

(b) Give one way of modifying the definition of Turing machines so that they can still recognise all regular languages but can no longer recognise all decidable languages.

For full marks, your modification should be as simple as possible. It should involve altering just one part of the definition of Turing machines. Replacement of an entire machine by something else is not acceptable.

No proof is required for this question.

Official use only

Question 13 (4 marks)

For each of the following decision problems, indicate whether or not it is decidable.

You may assume that, when Turing machines are encoded as strings, this is done using the Code-Word Language (CWL).

Decision Problem your answer

(tick one box

Input: two Turing machines M1 and M2.

Question: Does M1 eventually halt, when given M2 as

input? Decidable

in each row)

Undecidable

Undecidable

Undecidable

Undecidable

Input: two Turing machines M1 and M2.

Question: Does M1 have the same number of states as M2 ?

Input: two Turing machines M1 and M2.

Question: Is M1 equivalent to M2 (i.e., do M1 and M2 have the same sets of accepted strings and the same sets of rejected strings)?

Input: two Turing machines M1 and M2.

Question: If each machine is given itself as input, does M1 finish before M2?

Official use only

Question 14 (12 marks)

The Venn diagram on the next page shows several classes of languages. For each language (a)–(j) in the list below, indicate which classes it belongs to, and which it doesn’t belong to, by placing its corresponding letter in the correct region of the diagram.

If a language does not belong to any of these classes, then place its letter above the top of the diagram.

You may assume that, when Turing machines are encoded as strings, this is done using the Code-Word Language (CWL), with input alphabet {a,b} and tape alphabet {a,b,#,∆}.

(a) (b) (c)

The set of all binary strings.

The set of all strings in which every a occurs before every b.

The set of all strings in which a occurs more times than b.

The set of all strings in which every a occurs before every band ALSO a occurs more

times than b.

The set of adjacency matrices of 2-colourable graphs.

The set of adjacency matrices of 4-colourable graphs.

The set of all Boolean expressions in Conjunctive Normal Form (CNF), whether satisfi-

able or unsatisfiable. (Assume the variables are x1, x2, . . . , xn, and variable xi is represented by its index i as a binary positive integer.)

The set of all encodings of Turing machines that accept regular languages.

The set of all encodings of Turing machines that accept non-context-free languages. The set of all encodings of Turing machines that loop forever for some input.

and addition, subtraction, multiplication and division, but with no parentheses.

The set of all arithmetic expressions involving positive integers, in decimal notation,

(l) The set of all arithmetic expressions involving positive integers, in decimal notation, and addition, subtraction and parentheses, but no multiplication or division.

recursively enumerable (r.e.)

Context-Free

Official use only

Working Space

Question 15 (8 marks)

Let L and K be languages. Suppose that K is finite.

Definition: The symmetric difference L∆K consists of all strings that belong to L or

K,butnotboth. Inotherwords,L∆K=(L∪K)(L∩K).

(a) Prove that there exists a mapping reduction from L to L∆K.

(b) Prove that L is undecidable if and only if L∆K is undecidable.

Official use only

Question 16 (5 marks)

An enumerator for a language is normally allowed to output a given string in the language more than once. A direct enumerator is an enumerator which never outputs a string more than once.

Prove that if a language has an enumerator then it has a direct enumerator.

Official use only

Question 17 (11 marks) A vertex cover in a graph G is a set X of vertices that meets every edge of G. So,

every edge is incident with at least one vertex in X.

The VERTEX COVER decision problem is as follows.

VERTEX COVER

Input: Graph G.

Question: Does G have a vertex cover?

For example, in the following graph, the vertex set {u, w, x} is a vertex cover, and so is {v, w}. But {u, x} is not a vertex cover, since it does not meet every edge. (Specifically, it misses the diagonal edge c.)

wdx Let W be the above graph.

(a)ConstructaBooleanexpressionEW inConjunctiveNormalFormsuchthatthesatisfying truth assignments for EW correspond to vertex covers in the above graph W.

(b) Give a polynomial-time reduction from VERTEX COVER to SATISFIABILITY.

Official use only

Question 18 (8 marks)

Prove that the problem LONG PATH is NP-complete, using reduction from HAMIL- TONIAN PATH. You may assume that HAMILTONIAN PATH is NP-complete.

Definitions:

HAMILTONIAN PATH

Input: Graph G.

Question: Does G have a path that contains every vertex?

Input: Graph G, with an even number of vertices. Question: Does G contain a path of length ≥ n/2?

In each of these definitions, n is the number of vertices in the graph G.

Official use only

Working Space

Working Space

END OF EXAMINATION