Last update: Sun Oct 15 02:56:11 MDT 2017
@Article{Tomescu:1998:WCA, author = "Ioan Tomescu", title = "On words containing all short subwords", journal = j-THEOR-COMP-SCI, volume = "197", number = "1--2", pages = "235--240", day = "15", month = may, year = "1998", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Mon Jul 19 22:21:46 MDT 1999", bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1998&volume=197&issue=1-2; http://www.math.utah.edu/pub/tex/bib/tcs1995.bib", URL = "http://www.elsevier.com/cas/tree/store/tcs/sub/1998/197/1-2/2767.pdf", acknowledgement = ack-nhfb, classification = "C4210L (Formal languages and computational linguistics)", conftitle = "Linear Logic '96 (papers in summary form only received)", corpsource = "Fac. of Math., Bucharest Univ., Romania", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "finite alphabet; formal languages; short subwords", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", }