Scribd
Upload
3 views1 page

Ch14 Qs

The document outlines Team Assignment 9 focused on Chapter 14 regarding Time Complexity, due on April 7. It includes tasks such as proving whether 3n is in O(2n), designing a Turing Machine for a specific language L, and analyzing its time complexity. The assignment is divided into parts with specified point values for each question.

Uploaded by

chowresearch22
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
3 views1 page

Ch14 Qs

The document outlines Team Assignment 9 focused on Chapter 14 regarding Time Complexity, due on April 7. It includes tasks such as proving whether 3n is in O(2n), designing a Turing Machine for a specific language L, and analyzing its time complexity. The assignment is divided into parts with specified point values for each question.

Uploaded by

chowresearch22
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

Team Assignment 9: Chapter 14.

Time Complexity
Due Thursday, April 7

Names: Section: Score: /50 pts

1. [15 pts] Is 3n ∈ O(2n )? Prove your answer. (Problem 14.4 on Page 462)

2. Let L be the language over { a, b } that contains a string u if it satisfies one of the following
conditions (Problem 14.11 on Page 464):

(i) u = ai bi and length(u) ≤ 100, or


(ii) length(u) > 100.

(a) [20 pts] Design a standard TM M that accepts L.


(b) [10 pts] Give the function tcM .
(c) [ 5 pts] What is the best polynomial rate of growth that describes tcM ?

You might also like