Learning Residual Finite-State Automata Using Observation Tables

• DOI: 10.4204/eptcs.31.23
• Publication Date: 2010-08-06T20:48:33Z
• Authors: Anna Kasprzik
• Keywords: FOS: Computer and information sciences; Formal Languages and Automata Theory (cs.FL); Electronic computers. Computer science; QA1-939; Computer Science - Formal Languages and Automata Theory; QA75.5-76.95; 0102 computer and information sciences; 01 natural sciences; Mathematics

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.<br/>In Proceedings DCFS 2010, arXiv:1008.1270<br/>