Last update: Wed Sep 26 02:11:46 MDT 2018
@Article{Csuhaj-Varju:1993:DCC, author = "Erzs{\'e}bet Csuhaj-Varj{\'u} and Alica Kelemenov{\'a}", title = "Descriptional complexity of context-free grammar forms", journal = j-THEOR-COMP-SCI, volume = "112", number = "2", pages = "277--289", day = "10", month = may, year = "1993", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Mon Jul 19 22:17:11 MDT 1999", bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1993&volume=112&issue=2; http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", URL = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1993&volume=112&issue=2&aid=1224", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C4240 (Programming and algorithm theory)", corpsource = "Comput. and Autom. Inst., Hungarian Acad. of Sci., Budapest, Hungary", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "computational complexity; context-free grammar forms; context-free grammars; descriptional complexity; grammatical complexity measures; infinite class; infinite grammar form; infinite language class", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", }