By Topic

Inference of regular grammars via skeletons

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Radhakrishnan, V. ; Dept. of Comput. Sci. & Eng., Indian Inst. of Technol., Bombay, India ; Nagaraja, G.

A constructive method for the inference of regular grammars from positive sample strings of language using skeletal structure descriptions, is proposed, and polynomial-time algorithms based on the method are presented. The algorithms infer in the limit a class of regular languages, designated as terminal distinguishable regular languages. They do not overgeneralize if the samples are from a certain class of context-free languages capturing one of these basic results in formal language theory. The algorithms are adaptable for online inference. A measure of goodness for constructive methods for the problem of grammatical inference is introduced. Several examples are given to show the working and behavior of the algorithms.

Published in:

Systems, Man and Cybernetics, IEEE Transactions on  (Volume:17 ,  Issue: 6 )