Entry Hunt:1983:CMR 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{Hunt:1983:CMR,
  author =       "H. B. Hunt and D. J. Rosenkrantz",
  title =        "The complexity of monadic recursion schemes:
                 executability problems, nesting depth, and
                 applications",
  journal =      j-THEOR-COMP-SCI,
  volume =       "27",
  number =       "1--2",
  pages =        "3--38",
  month =        nov,
  year =         "1983",
  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); C4240 (Programming and
                 algorithm theory)",
  corpsource =   "Dept. of Computer Sci., State Univ. of New York,
                 Albany, NY, USA",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "computability and decidability; computational
                 complexity; decision problems; divergence;
                 executability problems; isomorphism; lower bounds;
                 monadic recursion schemes complexity; nesting depth;
                 polynomial bounds; strong equivalence; upper bounds;
                 weak equivalence",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

Related entries