Deciding the inequivalence of context-free grammars with 1-letter terminal alphabet is ΣP2-complete

14Citations
Citations of this article
10Readers
Mendeley users who have this article in their library.

Abstract

This paper deals with the complexity of context-free grammars with 1-letter terminal alphabet. We study the complexity of the membership problem and the inequivalence problem. We show that the first problem is NP-complete and the second one is ΣP2-complete with respect to log-space reduction. The second result also implies that the inequivalence problem is in Pspace, solving an open problem stated by Hunt, Rosenkrantz and Szymanski (1976). © 1984.

Cite

CITATION STYLE

APA

Huynh, D. T. (1984). Deciding the inequivalence of context-free grammars with 1-letter terminal alphabet is ΣP2-complete. Theoretical Computer Science, 33(2–3), 305–326. https://doi.org/10.1016/0304-3975(84)90092-6

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free