Regular Inference with a Tail-Clustering Method
Laurent Miclet · IEEE Transactions on Systems Man and Cybernetics · 1980
A characterization of the solutions to the regular grammatical Infrence problem and an Introduction to a methodology for Infering regular grammars, based on the clutering of the states of a "maximal" solution, are presented. Examples are given with a paricular design of this algorithm.