Entry Sakakibara:1990:LCF 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{Sakakibara:1990:LCF,
  author =       "Y. Sakakibara",
  title =        "Learning context-free grammars from structural data in
                 polynomial time",
  journal =      j-THEOR-COMP-SCI,
  volume =       "76",
  number =       "2-3",
  pages =        "223--242",
  day =          "21",
  month =        nov,
  year =         "1990",
  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 =   "Int. Inst. for Adv. Study of Social Inf. Sci., Fujitsu
                 Ltd., Shizuoka, Japan",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "computational complexity; context-free grammars;
                 correct grammar; efficient algorithm; equivalent;
                 frontier-to-root tree automaton; learning protocol;
                 minimally adequate teacher; polynomial time; query
                 types; structural data; structural descriptions;
                 structural equivalence queries; structural membership
                 queries; unknown grammar; unlabelled derivation trees",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

Related entries