Last update: Wed Sep 26 02:11:46 MDT 2018
@Article{Revuz:1992:MAD,
author = "D. Revuz",
title = "Minimisation of acyclic deterministic automata in
linear time",
journal = j-THEOR-COMP-SCI,
volume = "92",
number = "1",
pages = "181--189",
day = "06",
month = jan,
year = "1992",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:24:22 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib",
acknowledgement = ack-nhfb,
classification = "C1180 (Optimisation techniques); C4220 (Automata
theory)",
conflocation = "Paris, France; July 1990",
conftitle = "Combinatorial Pattern Matching School",
corpsource = "CERIL, Evry, France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "acyclic deterministic automata; automaton; finite
automata; lexicons; linear time; minimisation",
pubcountry = "Netherlands",
treatment = "P Practical; T Theoretical or Mathematical",
}