On the Flexibility in order of Processing Sample Strings 'Source Title' Mehran University Research Journal of Engineering and Technology Volume Vol.3, No.3
Bibliographic details
Summary
Feldamn et al. have given an algorithm for inferring a regular grammer from a finite sample of strings. As the algorithm infers different grammars and of different sizes for a sample with different order of presentation of its strings, Feldman and his collaborators suggested the processing of sample's strings in the order of decreasing lengthus. This is the order for which their algorithm infers equivalent grammars of small number of rewriting rules. Since the strings of the sample can not be presented in a sufficiently large number of ways in this order, this may appear a serous problems to some users besides their interest of inferring a grammar of small number of rewriting rules for their sample. In this paper, another order to presentation of strings is defined which is more flexible as compared to the one given by Feldman et al.