TY - JOUR
TI - Grammatical inference of directed acyclic graph languages with polynomial time complexity
AU - Gallego, Antonio-Javier
AU - López Rodríguez, Damián
AU - Calera Rubio, Jorge
DA - 2018-08
UR - http://hdl.handle.net/10045/75210
AB - 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.
KW - Graph languages
KW - Graph automata
KW - Grammatical inference
KW - k-Testable languages
DO - 10.1016/j.jcss.2017.12.002
SN - 0022-0000 (Print)
PB - Elsevier
ER -