Entry Huynh:1984:DIC from tcs1980.bib

Last update: Thu Sep 27 02:46:46 MDT 2018                Valid HTML 4.0!

Index sections

Top | Math | A | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | S | T | U | V | W | X | Y | Z

BibTeX entry

@Article{Huynh:1984:DIC,
  author =       "D. T. Huynh",
  title =        "Deciding the inequivalence of context-free grammars
                 with $1$- letter terminal alphabet is
                 ${\Sigma}_2^p$-complete",
  journal =      j-THEOR-COMP-SCI,
  volume =       "33",
  number =       "2-3",
  pages =        "305--326",
  month =        oct,
  year =         "1984",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Sat Nov 22 13:29:49 MST 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic); C4240 (Programming and
                 algorithm theory)",
  corpsource =   "Fachbereich Inf., Saarlandes Univ., Saarbrucken, West
                 Germany",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "1-letter terminal alphabet; computational complexity;
                 context-free grammars; decision problems; decision
                 theory; equivalence; equivalence classes; inequivalence
                 problem; log-space reduction; membership problem;
                 Sigma/sub 2//sup p/-completeness",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

Related entries