Deciding the inequivalence of context-free grammars with 1-letter terminal alphapet is \(\sum ^ p_ 2\)-complete (Q761043)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3887098
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Deciding the inequivalence of context-free grammars with 1-letter terminal alphapet is \(\sum ^ p_ 2\)-complete |
scientific article; zbMATH DE number 3887098 |
Statements
Deciding the inequivalence of context-free grammars with 1-letter terminal alphapet is \(\sum ^ p_ 2\)-complete (English)
0 references
1984
0 references
This paper deals with the computational complexity of two fundamental decision problems for context-free grammars with 1-letter terminal alphabet, namely the membership and inequivalence problems. The main results of this paper are: (1) The membership problem is log-complete for NP, and (2) The inequivalence problem is log-complete for \(\sum^ p_ 2\). In particular, the second result implies that the inequivalence problem for this restricted grammar class is in PSPACE, thereby setting an open question posed by \textit{H. B. Hunt III}, \textit{D. J. Rosenkrantz} and \textit{T. G. Szymanski} [J. Comput. Syst. Sci. 12, 222-268 (1976; Zbl 0334.68044)].
0 references
equivalence
0 references
computational complexity
0 references
decision problems
0 references
context-free grammars
0 references
membership
0 references
0 references
0.8509847521781921
0 references
0.80653315782547
0 references
0.7815200090408325
0 references
