@article{Bubenzer2014,
  author    = {Bubenzer, Johannes},
  title     = {Cycle-aware minimization of acyclic deterministic finite-state automata},
  series = {Discrete applied mathematics},
  volume    = {163},
  journal   = {Discrete applied mathematics},
  publisher = {Elsevier},
  address   = {Amsterdam},
  issn      = {0166-218X},
  doi       = {10.1016/j.dam.2013.08.003},
  pages     = {238 -- +},
  year      = {2014},
  abstract  = {In this paper a linear-time algorithm for the minimization of acyclic deterministic finite-state automata is presented. The algorithm runs significantly faster than previous algorithms for the same task. This is shown by a comparison of the running times of both algorithms. Additionally, a variation of the new algorithm is presented which handles cyclic automata as input. The new cycle-aware algorithm minimizes acyclic automata in the desired way. In case of cyclic input, the algorithm minimizes all acyclic suffixes of the input automaton.},
  language  = {en}
}