Local Languages, the Succesor Method, and a Step Towards a General Methodology for the Inference of Regular Grammars

A methodology is proposed for the inference of regular grammars from positive samples of their languages. It is mainly based on the generative mechanism associated with local languages, which allows us to obtain arbitrary regular languages by applying morphic operators to local languages. The actual inference procedure of this methodology consists of obtaining a local language associated with the given positive sample. This procedure, which is very simple, is always the same, regardless of the problem considered, while the task-dependent features that are desired for the inferred languages, are specified through the definition of certain task-appropriate symbol renaming functions (morphisms).

[1]  E. Mark Gold,et al.  Language Identification in the Limit , 1967, Inf. Control..

[2]  Enrique Vidal,et al.  Modelling (sub)string-length based constraints through a grammatical inference method , 1987 .

[3]  Stephen Y. Itoga.  A New Heuristic for Inferring Regular Grammars , 1981, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[4]  Samuel Eilenberg,et al.  Automata, languages, and machines. A , 1974, Pure and applied mathematics.

[5]  R. E. Blake,et al.  Experiments in dynamic programming inference of Markov networks with strings representing speech data , 1986, Pattern Recognit..

[6]  Laurent Miclet.  Regular Inference with a Tail-Clustering Method , 1980, IEEE Transactions on Systems, Man, and Cybernetics.

[7]  C. Chirathamjaree,et al.  A method for the inference of non-recursive context-free grammars , 1980 .

[8]  O. Firschein,et al.  Syntactic pattern recognition and applications , 1983, Proceedings of the IEEE.

[9]  Arto Salomaa.  Jewels of formal language theory , 1981 .

[10]  Taylor L. Booth,et al.  Grammatical Inference: Introduction and Survey - Part I , 1975, IEEE Trans. Syst. Man Cybern..

[11]  Marc Richetin,et al.  Efficient regular grammatical inference for pattern recognition , 1984, Pattern Recognit..

[12]  Maurice Gross,et al.  Introduction to Formal Grammars , 1970, Springer Berlin Heidelberg.

[13]  Jerome A. Feldman,et al.  Some Decidability Results on Grammatical Inference and Complexity , 1972, Inf. Control..

[14]  Carl H. Smith,et al.  Inductive Inference: Theory and Methods , 1983, CSUR.