Last update: Wed Sep 26 02:11:46 MDT 2018
@Article{Apostolico:1993:EDQ, author = "Alberto Apostolico and Andrzej Ehrenfeucht", title = "Efficient detection of quasiperiodicities in strings", journal = j-THEOR-COMP-SCI, volume = "119", number = "2", pages = "247--265", day = "25", month = oct, year = "1993", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Mon Jul 19 22:17:38 MDT 1999", bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1993&volume=119&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=119&issue=2&aid=1252", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C4220 (Automata theory)", corpsource = "Dept. of Comput. Sci., Purdue Univ., West Lafayette, IN, USA", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "automata theory; data compression; formal languages; formal languages theory; quasiperiodic substrings; quasiperiodicities; regularity; strings", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", }