Is learning RFSAs better than learning DFAs?

Pedro García, José Ruiz, Antonio Cano, Gloria Alvarez

Producción: Capítulo del libro/informe/acta de congresoContribución a la conferenciarevisión exhaustiva

1 Cita (Scopus)

Resumen

Inference of RFSAs has been recently presented [1] as an alternative to inference of DFAs if the target language has been obtained by a random generation of NFAs. We propose in this paper the algorithm RPNI2, which is a variation of the previous RPNI, that also outputs DFAs as hypothesis. The experiments done using the same data as in [1] show that RPNI2 has an error rate very similar to the rate obtained in the inference of RFSAs, but the size of the hypothesis is substantially smaller.

Idioma originalInglés
Título de la publicación alojadaImplementation and Application of Automata - 10th International Conference, CIAA 2005, Revised Selected Papers
EditorialSpringer Verlag
Páginas343-344
Número de páginas2
ISBN (versión impresa)3540310231, 9783540310235
DOI
EstadoPublicada - 2006
Evento10th International Conference on Implementation and Application of Automata, CIAA 2005 - Sophia Antipolis, Francia
Duración: 27 jun. 200529 jun. 2005

Serie de la publicación

NombreLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volumen3845 LNCS
ISSN (versión impresa)0302-9743
ISSN (versión digital)1611-3349

Conferencia

Conferencia10th International Conference on Implementation and Application of Automata, CIAA 2005
País/TerritorioFrancia
CiudadSophia Antipolis
Período27/06/0529/06/05

Huella

Profundice en los temas de investigación de 'Is learning RFSAs better than learning DFAs?'. En conjunto forman una huella única.

Citar esto