Grammatical inference of directed acyclic graph languages with polynomial time complexity

Empreu sempre aquest identificador per citar o enllaçar aquest ítem http://hdl.handle.net/10045/75210
Registre complet
Registre complet
Camp Dublin Core Valor Idioma
dc.contributorReconocimiento de Formas e Inteligencia Artificiales_ES
dc.contributor.authorGallego, Antonio-Javier-
dc.contributor.authorLópez Rodríguez, Damián-
dc.contributor.authorCalera Rubio, Jorge-
dc.contributor.otherUniversidad de Alicante. Departamento de Lenguajes y Sistemas Informáticoses_ES
dc.date.accessioned2018-05-03T08:49:24Z-
dc.date.available2018-05-03T08:49:24Z-
dc.date.issued2018-08-
dc.identifier.citationJournal of Computer and System Sciences. 2018, 95: 19-34. doi:10.1016/j.jcss.2017.12.002es_ES
dc.identifier.issn0022-0000 (Print)-
dc.identifier.issn1090-2724 (Online)-
dc.identifier.urihttp://hdl.handle.net/10045/75210-
dc.description.abstractIn 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.languageenges_ES
dc.publisherElsevieres_ES
dc.rights© 2017 Elsevier Inc.es_ES
dc.subjectGraph languageses_ES
dc.subjectGraph automataes_ES
dc.subjectGrammatical inferencees_ES
dc.subjectk-Testable languageses_ES
dc.subject.otherLenguajes y Sistemas Informáticoses_ES
dc.titleGrammatical inference of directed acyclic graph languages with polynomial time complexityes_ES
dc.typeinfo:eu-repo/semantics/articlees_ES
dc.peerreviewedsies_ES
dc.identifier.doi10.1016/j.jcss.2017.12.002-
dc.relation.publisherversionhttps://doi.org/10.1016/j.jcss.2017.12.002es_ES
dc.rights.accessRightsinfo:eu-repo/semantics/openAccesses_ES
Apareix a la col·lecció: INV - GRFIA - Artículos de Revistas

Arxius per aquest ítem:
Arxius per aquest ítem:
Arxiu Descripció Tamany Format  
Thumbnail2018_Gallego_etal_JCompSysSci_final.pdfVersión final (acceso restringido)807,26 kBAdobe PDFObrir     Sol·licitar una còpia
Thumbnail2018_Gallego_etal_JCompSysSci_accepted.pdfAccepted Manuscript (acceso abierto)860,69 kBAdobe PDFObrir Vista prèvia


Tots els documents dipositats a RUA estan protegits per drets d'autors. Alguns drets reservats.