Entry Bertoni:1991:CCN 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{Bertoni:1991:CCN,
  author =       "A. Bertoni and M. Goldwurm and N. Sabadini",
  title =        "The complexity of computing the number of strings of
                 given length in context-free languages",
  journal =      j-THEOR-COMP-SCI,
  volume =       "86",
  number =       "2",
  pages =        "325--342",
  day =          "02",
  month =        sep,
  year =         "1991",
  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 =   "Dipartimento di Sci. dell'Inf., Milano Univ., Italy",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "ambiguity degree; combinatorics; complexity;
                 computational complexity; context-free languages;
                 counting problems; exponential time recognizable
                 languages; formal languages; parallel algorithms;
                 sparse sets; string computations",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

Related entries