LALR(k) Testing is PSPACE-Complete

Esko Ukkonen Eljas Soisalon-Soininen

Published in: STOC (1981)

Keyphrases

pspace complete
np complete
model checking
decision problems
satisfiability problem
exptime complete
tree automata
strips planning
np hard
computational complexity