Deciding the Inequivalence of Context-Free Grammars with 1-Letter Terminal Alphabet is Sigma-p-2-Complete

Dung T. Huynh. Deciding the Inequivalence of Context-Free Grammars with 1-Letter Terminal Alphabet is Sigma-p-2-Complete. Theoretical Computer Science, 33:305-326, 1984.

Authors

Dung T. Huynh

This author has not been identified. Look up 'Dung T. Huynh' in Google