论文信息 - Deciding the inequivalence of context-free grammars with 1-letter terminal alphabet is S2p-complete

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

This paper deals with the complexity of context-free grammars with 1-1etter 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 Σ2p- complete with respect to log-space reduction. The second result also implies that the inequivalence problem is in PSPACE, solving an open problem stated in [3] by Hunt III, Rosenkrantz and Szymanski.

Thiet-Dung Huynh | Thiet-Dung Huynh

[1] José Lucas Rangel. The Equivalence Problem for Regular Expressions over one Letter Is Elementary , 1974, SWAT.

[2] Albert R. Meyer,et al. Word problems requiring exponential time(Preliminary Report) , 1973, STOC.

[3] Dung T. Huynh,et al. Commutative Grammars: The Complexity of Uniform Word Problems , 1984, Inf. Control..

[4] Larry Joseph Stockmeyer,et al. The complexity of decision problems in automata theory and logic , 1974 .

[5] Thiet-Dung Huynh. The Complexity of Semilinear Sets , 1982, J. Inf. Process. Cybern..

[6] T. G. Szymanski,et al. On the Equivalence, Containment, and Covering Problems for the Regular and Context-Free Languages , 1976, J. Comput. Syst. Sci..

[7] Seymour Ginsburg,et al. The mathematical theory of context free languages , 1966 .

[8] Martin Fürer. The Complexity of the Inequivalence Problem for Regular Expressions with Intersection , 1980, ICALP.