Entry Middeldorp:1997:STR from tcs1995.bib

Last update: Sun Oct 15 02:56:11 MDT 2017                Valid HTML 3.2!

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{Middeldorp:1997:STR,
  author =       "Aart Middeldorp and Hans Zantema",
  title =        "Simple termination of rewrite systems",
  journal =      j-THEOR-COMP-SCI,
  volume =       "175",
  number =       "1",
  pages =        "127--158",
  day =          "30",
  month =        mar,
  year =         "1997",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:20:44 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1997&volume=175&issue=1;
                 http://www.math.utah.edu/pub/tex/bib/tcs1995.bib",
  URL =          "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1997&volume=175&issue=1&aid=2385",
  acknowledgement = ack-nhfb,
  classification = "C4210L (Formal languages and computational
                 linguistics)",
  conflocation = "Kanazawa, Japan; 5-8 Dec. 1994",
  conftitle =    "Workshop on Non-Standard Logics and Logical Aspects of
                 Computer Science",
  corpsource =   "Inst. of Inf. Sci. and Electron., Tsukuba Univ.,
                 Ibaraki, Japan",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "decidability; finite signature; infinite signatures;
                 recursive path order; rewrite systems; rewriting
                 systems; simple termination; simplification order;
                 strict partial orders; subterm property",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

Related entries