On the Membership Problem of Permutation Grammars - A Direct Proof of NP-Completeness

Benedek Nagy. On the Membership Problem of Permutation Grammars - A Direct Proof of NP-Completeness. Int. J. Found. Comput. Sci., 31(4):515-525, 2020. [doi]

Abstract

Abstract is missing.