• DocumentCode
    2188306
  • Title

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

  • Author

    Huynh, Thiet-Dung ; Huynh, Thiet-Dung ; Huynh, Thiet-Dung ; Huynh, Thiet-Dung

  • fYear
    1982
  • fDate
    3-5 Nov. 1982
  • Firstpage
    21
  • Lastpage
    31
  • Abstract
    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.
  • Keywords
    Automata; Complexity theory; Computational complexity; Formal languages; Ice; Mathematics; Polynomials; Tellurium;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Foundations of Computer Science, 1982. SFCS '08. 23rd Annual Symposium on
  • Conference_Location
    Chicago, IL, USA
  • ISSN
    0272-5428
  • Type

    conf

  • DOI
    10.1109/SFCS.1982.65
  • Filename
    4568370
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2188306