Mostrar el registro completo del ítem
López Rodríguez, D.; Calera Rubio, J.; Gallego-Sánchez, A. (2012). Inference of k-Testable Directed Acyclic Graph Languages. JMLR: Workshop and Conference Proceedings. 21:149-163. http://hdl.handle.net/10251/47562
Por favor, use este identificador para citar o enlazar este ítem: http://hdl.handle.net/10251/47562
Título: | Inference of k-Testable Directed Acyclic Graph Languages | |
Autor: | Calera Rubio, Jorge Gallego-Sánchez, Antonio-Javier | |
Entidad UPV: |
|
|
Fecha difusión: |
|
|
Resumen: |
In this paper, we tackle the task of graph language learning. We first extend the well-known
classes of k-testability and k-testability in the strict sense languages to directed graph languages.
Second, we propose a graph ...[+]
|
|
Palabras clave: |
|
|
Derechos de uso: | Reserva de todos los derechos | |
Fuente: |
|
|
Editorial: |
|
|
Versión del editor: | http://www.jmlr.org/proceedings/papers/v21/ | |
Título del congreso: |
|
|
Lugar del congreso: |
|
|
Fecha congreso: |
|
|
Código del Proyecto: |
|
|
Agradecimientos: |
Damián López is partially supported by the Spanish Ministerio de Economía y Competitividad under research project TIN2011-28260-C03-01. Jorge Calera-Rubio and Antonio-Javier Gallego-Sánchez thank the Spanish CICyT for ...[+]
|
|
Tipo: |
|