PSPACE closed under union

From: "cooldavid" <vmvictorvm@xxxxxxxxx>
Date: 11 Apr 2007 12:33:14 -0700

Hi,

I have trouble proving PSPACE is closed under union, complementation
and star.

But for now, I want to know how to prove for under UNION only.

I know that we have to:
Let L1 in PSPACE and L2 in PSPACE.
Want to show: L1 U L2 in PSPACE

How to show that?

.

Follow-Ups:
- Re: PSPACE closed under union
  - From: hbdere

Prev by Date: Re: Category Theory of Algorithms
Next by Date: Re: Category Theory of Algorithms
Previous by thread: lex yacc ???
Next by thread: Re: PSPACE closed under union
Index(es):
- Date
- Thread

Relevant Pages

Re: Problems in NP^(NP^NP) that are not in NP^NP?
... why can't we say that PH = PSPACE? ... This is a common confusion. ... Since PH is the union of its levels, any problem in PH must belong to ... Dialogues Concerning Two New Sciences ...
(comp.theory)
Re: Problems in NP^(NP^NP) that are not in NP^NP?
... why can't we say that PH = PSPACE? ... This is a common confusion. ... Since PH is the union of its levels, any problem in PH must belong to ... Thanks for clarifying. ...
(comp.theory)