The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.06 - June (1987 vol.9)
pp: 841-845
Pedro Garcia , Department of Sistemas Infomaticos y Computacion, Facultad de Informatica, Unviersidad Politecnica de Valencia, 46071 Valencia, Spain.
Enrique Vidal , Department of Sistemas Infomaticos y Computacion, Facultad de Informatica, Unviersidad Politecnica de Valencia, 46071 Valencia, Spain.
Francisco Casacuberta , Department of Sistemas Infomaticos y Computacion, Facultad de Informatica, Unviersidad Politecnica de Valencia, 46071 Valencia, Spain.
ABSTRACT
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).
CITATION
Pedro Garcia, Enrique Vidal, Francisco Casacuberta, "Local Languages, the Succesor Method, and a Step Towards a General Methodology for the Inference of Regular Grammars", IEEE Transactions on Pattern Analysis & Machine Intelligence, vol.9, no. 6, pp. 841-845, June 1987, doi:10.1109/TPAMI.1987.4767991
19 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool