Trusted by Students Everywhere
Why Choose Us?
0% AI Guarantee

Human-written only.

24/7 Support

Anytime, anywhere.

Plagiarism Free

100% Original.

Expert Tutors

Masters & PhDs.

100% Confidential

Your privacy matters.

On-Time Delivery

Never miss a deadline.

COMP 330 - Fall 2020 - Assignment 6 1

Computer Science Nov 27, 2020

COMP 330 - Fall 2020 - Assignment 6

1. Rigorously establish the decidability or undecidability of the following languages:

(a) (20 Points)

L = {0 n |the decimal expansion of π = 3.14 . . . contains n (or more) consecutive 0’s}.

(b) (20 Points)

L = {hDi | D is a DFA and L(D) is not recognized by a DFA with fewer states}.

2. (30 Points) Prove that the following language is undecidable by giving a reduction from the Post Correspondence Problem.

L = {hGi | G is a CFG and L(G) contains at least one palindrome}.

3. (30 Points) Let A be any language in P over the alphabet {0, 1}. Prove that

LA = {1 n | n ∈ N, A ∩ {0, 1} n 6= ∅}

is in NP.

Archived Solution
Unlocked Solution

You have full access to this solution. To save a copy with all formatting and attachments, use the button below.

Already a member? Sign In
Important Note: This solution is from our archive and has been purchased by others. Submitting it as-is may trigger plagiarism detection. Use it for reference only.

For ready-to-submit work, please order a fresh solution below.

Or get 100% fresh solution
Get Custom Quote
Secure Payment