New User Special Price Expires in

Let's log you in.

Sign in with Facebook


Don't have a StudySoup account? Create one here!


Create a StudySoup account

Be part of our community, it's free to join!

Sign up with Facebook


Create your account
By creating an account you agree to StudySoup's terms and conditions and privacy policy

Already have a StudySoup account? Login here

Automata and Complexity

by: Alayna Veum

Automata and Complexity CS 4510

Alayna Veum

GPA 3.81


Almost Ready


These notes were just uploaded, and will be ready to view shortly.

Purchase these notes here, or revisit this page.

Either way, we'll remind you when they're ready :)

Preview These Notes for FREE

Get a free preview of these Notes, just enter your email below.

Unlock Preview
Unlock Preview

Preview these materials now for free

Why put in your email? Get access to more of this material and other relevant free materials for your school

View Preview

About this Document

Class Notes
25 ?




Popular in Course

Popular in ComputerScienence

This 0 page Class Notes was uploaded by Alayna Veum on Monday November 2, 2015. The Class Notes belongs to CS 4510 at Georgia Institute of Technology - Main Campus taught by Staff in Fall. Since its upload, it has received 13 views. For similar materials see /class/234141/cs-4510-georgia-institute-of-technology-main-campus in ComputerScienence at Georgia Institute of Technology - Main Campus.

Similar to CS 4510 at

Popular in ComputerScienence


Reviews for Automata and Complexity


Report this Material


What is Karma?


Karma is the currency of StudySoup.

You can buy or earn more Karma at anytime and redeem it for class notes, study guides, flashcards, and more!

Date Created: 11/02/15
Cook7s NPCompleteness theorem Legal Windows Let N Q E F 6M 45 qa 4 be a xed ltape nondeterministic Turing machine that runs in time pn a polynomial LetA QUFU A reduction machine takes as input a string w that is an input to N and produces a formula F that simulates N on w that is the formula F is satis able if and only if N accepts w Let w be an input to N Assume that all computation paths of N on w has length t Treat each con guration of N on w as a length t string over A that has as the start and the end symbol De ne a table T with t 3 columns and t 1 rows where each row is a con guration with the rst row being the initial con guration C0 qswlwg Forl lt i lt tl and l lt j lt t2 the ijth window is a 2 X 3 window consisting of the six entries in Tij7 l Tij Tij l Ti lj 7 l Ti lj and Ti lj 1 Such a window is a legal window if it is one of the following 0 State as the center symbol of the top row 7 For all transitions 6p a that includes 4 d L the following are legal windows p a q I d i 7 For all transitions 6p a that includes 4 d R the following are legal windows For all I E F Forallbel b p a bdq 0 State as the rightmost symbol of the top row 7 For all transitions from state p that includes q 7L for whatever symbol read and whatever symbol written the following are legal windows For all 125 6 F c q I 7 For all transitions from state p that includes q d R for whatever symbol read the following are legal windows 5 b p For all 125 6 F c b d 0 State as the leftmost symbol of the top row 7 For all transitions 6p a that includes 7 d L for whatever state it moves to the following are legal windows p a b d c i 7 For all transitions 6p a that includes 4 d R the following are legal windows p a d L c a b c a b c i 7 For all transitions to q 7L from whatever state on whatever symbol read and whatever symbol written abc For all 125 6 F For all c E F o No state in the top row 7 For all abc E F For all abc E F a b q


Buy Material

Are you sure you want to buy this material for

25 Karma

Buy Material

BOOM! Enjoy Your Free Notes!

We've added these Notes to your profile, click here to view them now.


You're already Subscribed!

Looks like you've already subscribed to StudySoup, you won't need to purchase another subscription to get this material. To access this material simply click 'View Full Document'

Why people love StudySoup

Steve Martinelli UC Los Angeles

"There's no way I would have passed my Organic Chemistry class this semester without the notes and study guides I got from StudySoup."

Anthony Lee UC Santa Barbara

"I bought an awesome study guide, which helped me get an A in my Math 34B class this quarter!"

Bentley McCaw University of Florida

"I was shooting for a perfect 4.0 GPA this semester. Having StudySoup as a study aid was critical to helping me achieve my goal...and I nailed it!"

Parker Thompson 500 Startups

"It's a great way for students to improve their educational experience and it seemed like a product that everybody wants, so all the people participating are winning."

Become an Elite Notetaker and start selling your notes online!

Refund Policy


All subscriptions to StudySoup are paid in full at the time of subscribing. To change your credit card information or to cancel your subscription, go to "Edit Settings". All credit card information will be available there. If you should decide to cancel your subscription, it will continue to be valid until the next payment period, as all payments for the current period were made in advance. For special circumstances, please email


StudySoup has more than 1 million course-specific study resources to help students study smarter. If you’re having trouble finding what you’re looking for, our customer support team can help you find what you need! Feel free to contact them here:

Recurring Subscriptions: If you have canceled your recurring subscription on the day of renewal and have not downloaded any documents, you may request a refund by submitting an email to

Satisfaction Guarantee: If you’re not satisfied with your subscription, you can contact us for further help. Contact must be made within 3 business days of your subscription purchase and your refund request will be subject for review.

Please Note: Refunds can never be provided more than 30 days after the initial purchase date regardless of your activity on the site.