Comparison of Construction Algorithms for Minimal, Acyclic, Deterministic, Finite-State Automata from Sets of Strings

@inproceedings{Daciuk2002ComparisonOC,
  title={Comparison of Construction Algorithms for Minimal, Acyclic, Deterministic, Finite-State Automata from Sets of Strings},
  author={Jan Daciuk},
  booktitle={CIAA},
  year={2002}
}
This paper compares various methods for constructing minimal, deterministic, acyclic, finite-state automata (recognizers) from sets of words. Incremental, semi-incremental, and non-incremental methods have been implemented and evaluated. 

References

Publications referenced by this paper.

Similar Papers

Loading similar papers…