A categorical interpretation of state merging algorithms for DFA inference
![Thumbnail](/xmlui/bitstream/handle/10234/206344/89255_VilarTorresJM_2024.pdf.jpg?sequence=5&isAllowed=y)
Visualitza/
Metadades
Mostra el registre complet de l'elementcomunitat-uji-handle:10234/9
comunitat-uji-handle2:10234/7038
comunitat-uji-handle3:10234/8634
comunitat-uji-handle4:
INVESTIGACIONMetadades
Títol
A categorical interpretation of state merging algorithms for DFA inferenceAutoria
Data de publicació
2024-02-08Editor
Elsevier Science DirectISSN
0031-3203; 1873-5142Cita bibliogràfica
Vilar, J. M. (2024). A categorical interpretation of state merging algorithms for DFA inference. Pattern Recognition, 110326.Tipus de document
info:eu-repo/semantics/articleVersió
info:eu-repo/semantics/publishedVersionParaules clau / Matèries
Resum
We use Category Theory to interpret the family of algorithms for inference of DFAs that work by merging states. This interpretation allows us to characterize the structure of the search space and to define criteria ... [+]
We use Category Theory to interpret the family of algorithms for inference of DFAs that work by merging states. This interpretation allows us to characterize the structure of the search space and to define criteria for the convergence of these algorithms to the correct DFA. We also prove that the well-known EDSM algorithm does not identify DFAs in the limit. [-]
Publicat a
Pattern Recognition, Vol. 150 (June 2024)Drets d'accés
info:eu-repo/semantics/openAccess
Apareix a les col.leccions
- LSI_Articles [362]