Last update: Thu Sep 27 02:46:39 MDT 2018
@Article{Hunt:1976:CPL,
author = "H. B. Hunt and D. J. Rosenkrantz and T. G. Szymanski",
title = "The covering problem for linear context-free
grammars",
journal = j-THEOR-COMP-SCI,
volume = "2",
number = "3",
pages = "361--382",
month = sep,
year = "1976",
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/tcs1975.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Center for Res. in Computing Technol., Harvard Univ.,
Cambridge, MA, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "context-free grammars; covering problem; grammatical
covering; linear context free grammars; similarity;
structural equivalence",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}