A Merging States Algorithm for Inference of RFSAs

  • Gloria Alvarez
  • Pedro García
  • José Ruiz
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4201)


The aim of this paper is to present MRIA, a new merging states algorithm for inference of Residual Finite State Automata.


Positive Sample Formal Language Target Language Input Sample Regular Language 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. 1.
    Denis, F., Lemay, A., Terlutte, A.: Learning regular languages using RFSAs. Theoretical Computer Science 313(2), 267–294 (2004)MATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    Hopcroft, J., Ullman, J.: Introduction to Automata Theory, Languages and Computation. Addison-Wesley, Reading (1979)MATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Gloria Alvarez
    • 1
  • Pedro García
    • 2
  • José Ruiz
    • 2
  1. 1.Pontificia Universidad Javeriana – Seccional Cali. Colombia 
  2. 2.Universidad Politécnica de Valencia. DSICSpain

Personalised recommendations