New answers tagged space-complexity
1
vote
Show Recognizing two Regular Expressions as equal is in PSPACE
A good account of this result is in the lecture notes of Dexter Kozen, although the original work of Meyer and Stockmeyer contains a refined space bounds. You may consult that version in Stockmeyer's ...
Top 50 recent answers are included
Related Tags
space-complexity × 491complexity-theory × 282
time-complexity × 143
algorithms × 68
turing-machines × 60
complexity-classes × 48
graphs × 32
reductions × 31
algorithm-analysis × 26
data-structures × 24
nondeterminism × 21
computability × 11
lower-bounds × 11
asymptotics × 10
np-complete × 9
sorting × 9
runtime-analysis × 8
space-analysis × 8
finite-automata × 7
recursion × 7
circuits × 7
regular-languages × 6
optimization × 6
context-free × 6
trees × 6