Learning Residual Finite-State Automata Using Observation Tables

Details Learning Residual Finite-State Automata Using Observation Tables Learning Residual Finite-State Automata Using Observation Tables

2010-08-10

arxiv.org/abs/1008.1663v1

EPTCS 31, 2010, pp. 205-212

Computer Science

Formal Languages and Automata Theory

In Proceedings DCFS 2010, arXiv:1008.1270

Scientific paper

10.4204/EPTCS.31.23

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.

Affiliated with

Also associated with

No associations

Rating

Learning Residual Finite-State Automata Using Observation Tables does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Learning Residual Finite-State Automata Using Observation Tables, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Learning Residual Finite-State Automata Using Observation Tables will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-583300