Entry Ehrenfeucht:1982:GPC 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{Ehrenfeucht:1982:GPC,
  author =       "A. Ehrenfeucht and J. Karhumaki and G. Rozenberg",
  title =        "The (generalized) Post Correspondence Problem with
                 lists consisting of two words is decidable",
  journal =      j-THEOR-COMP-SCI,
  volume =       "21",
  number =       "2",
  pages =        "119--144",
  month =        nov,
  year =         "1982",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Sat Nov 22 13:36:07 MST 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic)",
  corpsource =   "Dept. of Computer Sci., Univ. of Colorado, Boulder,
                 CO, USA",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "computability and decidability; decidable; formal
                 languages; lists; Post Correspondence Problem;
                 undecidable properties",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

Related entries