Grammatical inference of directed acyclic graph languages with polynomial time complexity

作者：Gallego Antonio Javier^*; Lopez Damian; Calera Rubio Jorge

来源：Journal of Computer and System Sciences, 2018, 95: 19-34.

DOI：10.1016/j.jcss.2017.12.002

• Graph languages
• Graph automata
• Grammatical inference
• k-Testable languages

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.

• 出版日期2018-8