- -

Grammatical inference of directed acyclic graph languages with polynomial time complexity

RiuNet: Institutional repository of the Polithecnic University of Valencia

Share/Send to

Cited by

Statistics

Grammatical inference of directed acyclic graph languages with polynomial time complexity

Show full item record

Gallego, A.; López Rodríguez, D.; Calera-Rubio, J. (2018). Grammatical inference of directed acyclic graph languages with polynomial time complexity. Journal of Computer and System Sciences. 95:19-34. https://doi.org/10.1016/j.jcss.2017.12.002

Por favor, use este identificador para citar o enlazar este ítem: http://hdl.handle.net/10251/136876

Files in this item

Item Metadata

Title: Grammatical inference of directed acyclic graph languages with polynomial time complexity
Author:
UPV Unit: Universitat Politècnica de València. Departamento de Sistemas Informáticos y Computación - Departament de Sistemes Informàtics i Computació
Issued date:
Embargo end date: 2020-08-31
Abstract:
[EN] 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 ...[+]
Subjects: Graph languages , Graph automata , Grammatical inference , K-Testable languages
Copyrigths: Embargado
Source:
Journal of Computer and System Sciences. (issn: 0022-0000 )
DOI: 10.1016/j.jcss.2017.12.002
Publisher:
Elsevier
Publisher version: https://doi.org/10.1016/j.jcss.2017.12.002
Type: Artículo

This item appears in the following Collection(s)

Show full item record