Search
Now showing items 1-1 of 1
GPSG-Recognition is NP-Hard
(1985-03-01)
Proponents of generalized phrase structure grammar (GPSG) cite its weak context-free generative power as proof of the computational tractability of GPSG-Recognition. Since context-free languages (CFLs) can be parsed ...