hwsol2.5 - Lofgren CSci 5403— Homework 2 Problem 5 Let s...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Lofgren CSci 5403— Homework 2 Problem 5 Let s n ) ≥ log n be time constructable. If L ∈ ASPACE s n )), then there is an alternating TM A which decides it using O s n )) space. We describe a deterministic machine D which decides L using 2 s n )) time. Given x , it determines which nodes in the configuration graph of A lead to an accept state. It does this by initializing a 2 s n )) bit array of 0s, one bit for each vertex in the configuration graph. It sets the accept state s) to 1, and then repeatedly considers the transition function of A . Following Definition 5.7 in our text, if C connects to C in the configuration graph, the state of C has an existential label, and the bit for C is a 1, then the bit for C is set to 1. If C connects to C and C , the state of C has a universal label, and the bits of C and C are set to 1, then the bit for C is set to one. It repeatedly checks every transition until no bits are set on some round....
View Full Document

This note was uploaded on 10/21/2011 for the course CSCI 5403 taught by Professor Sturtivant,c during the Spring '08 term at Minnesota.

Ask a homework question - tutors are online