Autor:	Kasprzik, Anna
Rok vydání:	2010
Předmět:	Computer Science - Formal Languages and Automata Theory
Zdroj:	EPTCS 31, 2010, pp. 205-212
Druh dokumentu:	Working Paper
DOI:	10.4204/EPTCS.31.23
Popis:	We define a two-step learner for RFSAs based on an observation table by using an algorithm for minimal DFAs to build a table for the reversal of the language in question and showing that we can derive the minimal RFSA from it after some simple modifications. We compare the algorithm to two other table-based ones of which one (by Bollig et al. 2009) infers a RFSA directly, and the other is another two-step learner proposed by the author. We focus on the criterion of query complexity. Comment: In Proceedings DCFS 2010, arXiv:1008.1270
Databáze:	arXiv
Externí odkaz:	http://arxiv.org/abs/1008.1663 Zobrazit plný text záznamu View this record from Arxiv