数学作业代写了解一下,可以快速完成数学作业和网课
967数学作业代写了解一下,可以快速完成数学作业 数学作业代写,我们每个人生活的方方面面都因为网络时代的来临而有所改变。就比如日常购物方面,从前的我们购买东西还需要到街上去,用一张一张的现金购买东西,...
View detailsSearch the whole station
数学代码代写 EXAM DURATION: 2 hours EXAM INSTRUCTIONS: Attempt ALL questions. The number in square brackets shows the maximum marks obtainable for that
EXAM DURATION: 2 hours
EXAM INSTRUCTIONS: Attempt ALL questions.
The number in square brackets shows the maximum marks obtainable for that question or part-question.
Your answers should contain the full working required to justify your solutions.
INSTRUCTIONS FOR ONLINE EXAMS:
Each page of your solution must have the page number, module code, and your student ID number at the top of the page. You must make sure all pages of your solutions are clearly legible.
a) Consider the DFA D1 given by ({q0, q1, q2}, {a, b}, δ1, q0, {q1}), where δ1 is
aq2 | b | |
q0 | q1 | q0 |
q1 | q2 | q1 |
q2 | q0 | q2 |
(i) Draw the diagram of D1. [2]
(iii) Prove that L(D1) is the set of words over the alphabet {a, b} that contain a number of as that is congruent to 1 modulo 3. [4]
(iv) Give a regular expression for L(D1). [2]
(b) Consider the regular expression R = a∗(aab + c2)∗ . Give the diagram of an NFA N such that L(N) = L(R). (You do not need to prove that N accepts the right language). [3]
(c) Let D2 = (Q, Σ, δ2, s0, T) be a DFA, and let a ∈ Σ. Assume that δ2(q, a) = q for all q ∈ Q. Prove that either {a}∗⊆ L(D2) or {a}∗∩ L(D2) = ∅. [2]
(a) Consider the language
L1 = {w ∈ {a, b}∗ : no initial subword of w has more as than bs}.
Design a PDA P such that L(P) = L1. (You do not need to prove that P accepts the right language). [3]
(i) Write down the configurations that can be reached by M on input ab, and on input abb. [3]
(ii) Does M halt on all input? Justify your answer. [4]
(b) For each of the following languages, say whether it is Turing decidable. Justify your answer in each case.
(i) L1 = {〈M〉 : M accepts at least two words}.
(ii) L2 = {〈M〉 : M’s read/write head never moves past the first 30 tape cells, for every input word w}. [4]
a) Show that if L1 and L2 are languages in NP then
L1L2 = {uv : u ∈ L1, v ∈ L2}
is in NP. [4]
(b) The language HugeClique is {〈G〉 : G is a finite graph with a clique of size at least |V (G)|/2}.
You may assume that graphs are encoded as in lectures, so that the length of the encoding is proportional to the square of the number of vertices.
(i) Draw an example of a graph with 4 vertices that is in HugeClique. [1]
(ii) Draw an example of a graph with 5 vertices and 5 edges that is not in HugeClique [1]
(iii) Prove that HugeClique is in NP. [2]
(iv) Fix an integer k. Construct a map f from the set of all finite graphs to the set of all finite graphs with at least 2k vertices such that 〈G, k〉∈Clique if and only if〈f(G)〉 ∈HugeClique. [2]
(v) Prove that Clique is polynomial-time reducible to HugeClique. [3]
(vi) Is HugeClique NP-complete? Justify your answer. [1]
更多代写:澳洲cs代考靠谱吗 托福作弊被抓 英国Chemistry化学网课exam代考 term paper写作指南 中文文献mla格式 金融工程作业代写
合作平台:essay代写 论文代写 写手招聘 英国留学生代写
数学作业代写了解一下,可以快速完成数学作业 数学作业代写,我们每个人生活的方方面面都因为网络时代的来临而有所改变。就比如日常购物方面,从前的我们购买东西还需要到街上去,用一张一张的现金购买东西,...
View detailsMath 2415 Final Exam 数学考试代做 To get full credit you must show ALL your work. The problems must be solved without any assistance of others or the usage of unauthorized material To get fu...
View detailsMth 440/540 Homework 计算数论作业代写 (1) Part I a.) Use Mathematica to determine the 100th prime, the 1000th prime, and the 10,000th prime. b.) Use Mathematica to determine the prime (1) ...
View detailsMath 124 - Programming forMathematical Applications Project 1 - The Trapped Knight 数学应用编程代写 Description In this project, you will write a computer code to generate a particular sequ...
View details