Last update: Sun Oct 15 02:56:11 MDT 2017
@Article{Breslauer:1998:STT, author = "Dany Breslauer", title = "The suffix tree of a tree and minimizing sequential transducers", journal = j-THEOR-COMP-SCI, volume = "191", number = "1--2", pages = "131--144", day = "30", month = jan, year = "1998", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Mon Jul 19 22:21:31 MDT 1999", bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1998&volume=191&issue=1-2; http://www.math.utah.edu/pub/tex/bib/tcs1995.bib", URL = "http://www.elsevier.com/cas/tree/store/tcs/sub/1998/191/1-2/2520.pdf", acknowledgement = ack-nhfb, classification = "C4220 (Automata theory); C4240C (Computational complexity)", corpsource = "Dept. of Comput. Sci., Aarhus Univ., Denmark", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "computational complexity; finite automata; minimization of sequential transducers; minimizing sequential transducers; suffix tree; tree; tree data structures", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", }