Is learning RFSAs better than learning DFAs?

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

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Scopus citations

Abstract

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.

Original languageEnglish
Title of host publicationImplementation and Application of Automata - 10th International Conference, CIAA 2005, Revised Selected Papers
PublisherSpringer Verlag
Pages343-344
Number of pages2
ISBN (Print)3540310231, 9783540310235
DOIs
StatePublished - 2006
Event10th International Conference on Implementation and Application of Automata, CIAA 2005 - Sophia Antipolis, France
Duration: 27 Jun 200529 Jun 2005

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3845 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference10th International Conference on Implementation and Application of Automata, CIAA 2005
Country/TerritoryFrance
CitySophia Antipolis
Period27/06/0529/06/05

Fingerprint

Dive into the research topics of 'Is learning RFSAs better than learning DFAs?'. Together they form a unique fingerprint.

Cite this