Regular Inference as a graph coloring problemFran cois Coste and

@inproceedings{NicolasIRISA1997RegularIA,
  title={Regular Inference as a graph coloring problemFran cois Coste and},
  author={Jacques NicolasIRISA},
  year={1997}
}
  • Jacques NicolasIRISA
  • Published 1997
We consider the problem of learning the set of all most general DFA consistent with a labeled sample. The paper proposess a constraints based speciication of the set of solutions and gives an eecient algorithm to build the system of constraints. The eeective production of DFA may then be reduced to a graph coloring problem. We have implemented and tested… CONTINUE READING