Cargando…
Efficient Deterministic Finite Automata Minimization Based on Backward Depth Information
Obtaining a minimal automaton is a fundamental issue in the theory and practical implementation of deterministic finite automatons (DFAs). A minimization algorithm is presented in this paper that consists of two main phases. In the first phase, the backward depth information is built, and the state...
| Autores principales: | , , , , |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
Public Library of Science
2016
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5091862/ https://www.ncbi.nlm.nih.gov/pubmed/27806102 http://dx.doi.org/10.1371/journal.pone.0165864 |