Grammatical inference of directed acyclic graph languages with polynomial time complexity
Por favor, use este identificador para citar o enlazar este ítem:
http://hdl.handle.net/10045/75210
Registro completo de metadatos
Campo DC | Valor | Idioma |
---|---|---|
dc.contributor | Reconocimiento de Formas e Inteligencia Artificial | es_ES |
dc.contributor.author | Gallego, Antonio-Javier | - |
dc.contributor.author | López Rodríguez, Damián | - |
dc.contributor.author | Calera Rubio, Jorge | - |
dc.contributor.other | Universidad de Alicante. Departamento de Lenguajes y Sistemas Informáticos | es_ES |
dc.date.accessioned | 2018-05-03T08:49:24Z | - |
dc.date.available | 2018-05-03T08:49:24Z | - |
dc.date.issued | 2018-08 | - |
dc.identifier.citation | Journal of Computer and System Sciences. 2018, 95: 19-34. doi:10.1016/j.jcss.2017.12.002 | es_ES |
dc.identifier.issn | 0022-0000 (Print) | - |
dc.identifier.issn | 1090-2724 (Online) | - |
dc.identifier.uri | http://hdl.handle.net/10045/75210 | - |
dc.description.abstract | In this paper we study the learning of graph languages. We extend the well-known classes of k-testability and k-testability in the strict sense languages to directed graph languages. We propose a grammatical inference algorithm to learn the class of directed acyclic k-testable in the strict sense graph languages. The algorithm runs in polynomial time and identifies this class of languages from positive data. We study its efficiency under several criteria, and perform a comprehensive experimentation with four datasets to show the validity of the method. Many fields, from pattern recognition to data compression, can take advantage of these results. | es_ES |
dc.language | eng | es_ES |
dc.publisher | Elsevier | es_ES |
dc.rights | © 2017 Elsevier Inc. | es_ES |
dc.subject | Graph languages | es_ES |
dc.subject | Graph automata | es_ES |
dc.subject | Grammatical inference | es_ES |
dc.subject | k-Testable languages | es_ES |
dc.subject.other | Lenguajes y Sistemas Informáticos | es_ES |
dc.title | Grammatical inference of directed acyclic graph languages with polynomial time complexity | es_ES |
dc.type | info:eu-repo/semantics/article | es_ES |
dc.peerreviewed | si | es_ES |
dc.identifier.doi | 10.1016/j.jcss.2017.12.002 | - |
dc.relation.publisherversion | https://doi.org/10.1016/j.jcss.2017.12.002 | es_ES |
dc.rights.accessRights | info:eu-repo/semantics/openAccess | es_ES |
Aparece en las colecciones: | INV - GRFIA - Artículos de Revistas |
Archivos en este ítem:
Archivo | Descripción | Tamaño | Formato | |
---|---|---|---|---|
2018_Gallego_etal_JCompSysSci_final.pdf | Versión final (acceso restringido) | 807,26 kB | Adobe PDF | Abrir Solicitar una copia |
2018_Gallego_etal_JCompSysSci_accepted.pdf | Accepted Manuscript (acceso abierto) | 860,69 kB | Adobe PDF | Abrir Vista previa |
Todos los documentos en RUA están protegidos por derechos de autor. Algunos derechos reservados.