Entry Narendran:1989:SPT from tcs1985.bib

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

Index sections

Top | Symbols | Numbers | 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{Narendran:1989:SPT,
  author =       "P. Narendran and F. Otto",
  title =        "Some polynomial-time algorithms for finite monadic
                 {Church--Rosser Thue} systems",
  journal =      j-THEOR-COMP-SCI,
  volume =       "68",
  number =       "3",
  pages =        "319--332",
  day =          "12",
  month =        nov,
  year =         "1989",
  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/tcs1985.bib",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic)",
  corpsource =   "General Electric Co., Schenectady, NY, USA",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "decidability; finite monadic Church--Rosser Thue
                 systems; monadic Thue systems; polynomial time
                 decidable; polynomial-time algorithms; reduction
                 sequences; rewriting systems; undecidable; uniform
                 conjugacy problem; uniform decision problems",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

Related entries