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)
Ver/ Abrir
Metadatos
Mostrar el registro completo del ítemcomunitat-uji-handle:10234/9
comunitat-uji-handle2:10234/7038
comunitat-uji-handle3:10234/8634
comunitat-uji-handle4:
INVESTIGACIONMetadatos
Título
A categorical interpretation of state merging algorithms for DFA inferenceAutoría
Fecha de publicación
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.Tipo de documento
info:eu-repo/semantics/articleVersión
info:eu-repo/semantics/publishedVersionPalabras clave / Materias
Resumen
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. [-]
Publicado en
Pattern Recognition, Vol. 150 (June 2024)Derechos de acceso
info:eu-repo/semantics/openAccess
Aparece en las colecciones
- LSI_Articles [362]