Entry Palis:1992:UBR from tcs1990.bib

Last update: Wed Sep 26 02:11:46 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{Palis:1992:UBR,
  author =       "M. A. Palis and S. M. Shende",
  title =        "Upper bounds on recognition of a hierarchy of
                 non-context-free languages",
  journal =      j-THEOR-COMP-SCI,
  volume =       "98",
  number =       "2",
  pages =        "289--319",
  day =          "18",
  month =        may,
  year =         "1992",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Sat Nov 22 13:24:22 MST 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic); C4240 (Programming and
                 algorithm theory)",
  corpsource =   "Dept. of Comput. and Inf. Sci., Pennsylvania Univ.,
                 University Park, PA, USA",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "computational complexity; context-free grammars;
                 control grammars; control language hierarchy;
                 exponential time; formal languages; language
                 recognition; natural language recognition;
                 noncontext-free languages; polynomial time; time
                 complexity; uniform boolean circuits",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

Related entries