A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
Grammatical inference of directed acyclic graph languages with polynomial time complexity
2018
Journal of computer and system sciences (Print)
In this paper we study the learning of graph languages. We extend the wellknown classes of k-testability and k-testability in the strict sense languages to directed graph languages. Then, we propose a grammatical inference algorithm to learn the class of directed acyclic k-testable in the strict sense graph languages. We prove that the polynomial time complexity of the proposed algorithm, and we also prove that the algorithm identifies the defined class of languages from positive data. We also
doi:10.1016/j.jcss.2017.12.002
fatcat:mewnslgipzfodhmzwh5yd4p3xa