Title :
Regular Inference with a Tail-Clustering Method
Abstract :
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.
Keywords :
Algorithm design and analysis; Associate members; Automata; Cybernetics; Inference algorithms; Merging; Tail;
Journal_Title :
Systems, Man and Cybernetics, IEEE Transactions on
DOI :
10.1109/TSMC.1980.4308394
