Aller au contenu
Peerford
On the computational completeness of several descriptional complexity restrictions of semi-conditional grammars · Peerford