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.
@article{Huynh84,
title = {Deciding the Inequivalence of Context-Free Grammars with 1-Letter Terminal Alphabet is Sigma-p-2-Complete},
author = {Dung T. Huynh},
year = {1984},
tags = {context-aware, grammar},
researchr = {https://researchr.org/publication/Huynh84},
cites = {0},
citedby = {0},
journal = {Theoretical Computer Science},
volume = {33},
pages = {305-326},
}