Abstract
Grammatical inference is the problem of inferring a grammar, given a set of positive samples which the inferred grammar should accept and a set of negative samples which the grammar should not accept. Here we apply genetic algorithm for inferring regular languages. The genetic search is started from maximal canonical automaton built from structurally complete sample. In view of limiting the increasing complexity as the sample size grows, we have edited structurally complete sample. We have tested our algorithm for 16 languages and have compared our results with previous works of regular grammatical inference using genetic algorithm. The results obtained confirm the feasibility of applying genetic algorithm for regular grammatical inference.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
L. Miclet: Structural methods in pattern recognition. North Oxford Academic publication (1984)
Pierre Dupont, Regular Grammatical Inference from positive and negative samples by genetic search. Grammatical Inference and Applications, Second International Colloquium, ICGI-94, Proceedings, Berlin. Springer (1994)
S. Ramakrishnan, Application of genetic algorithm for regular grammatical inference. Mtech Dissertation, IIT-Bombay (1996)
D.E. Goldberg, Genetic Algorithms in search, optimization and machine learning. Addisson Wesley publication (1989)
Melanie Mitchell.: Introduction to genetic algorithms. MIT press (1996)
K.E. Man, K.S. Tang, S. Kwong.: Genetic algorithms: Concept and Design. Springer (1999)
A.W. Biermann and J.A. Feldmann: On the synthesis of Finite-State Machines from Samples of their behavior. IEEE Trans. Compt. C-21 592–597, (1972)
Rulot H and Vidal E.: Modeling (sub)string length based constraints through a Grammatical Inference method. Eu Pattern Recognition: Theory and Applications (451–459), Springer Verlag (1987)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pawar, P., Nagaraja, G. (2002). Regular Grammatical Inference: A Genetic Algorithm Approach. In: Pal, N.R., Sugeno, M. (eds) Advances in Soft Computing — AFSS 2002. AFSS 2002. Lecture Notes in Computer Science(), vol 2275. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45631-7_58
Download citation
DOI: https://doi.org/10.1007/3-540-45631-7_58
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43150-3
Online ISBN: 978-3-540-45631-5
eBook Packages: Springer Book Archive