Share Email Print
cover

Proceedings Paper

Learning to construct pushdown automata for accepting deterministic context-free languages
Author(s): Sandip Sen; Janani Janakiraman
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

Genetic algorithms (GAs) are a class of probabilistic optimization algorithms which utilize ideas from natural genetics. In this paper, we apply the genetic algorithm to a difficult machine learning problem, viz., to learn the description of pushdown automata (PDA) to accept a context-free language (CFL), given legal and illegal sentences of the language. Previous work has involved the use of GAs in learning descriptions for finite state machines for accepting regular languages. CFLs are known to properly include regular languages, and hence, the learning problem addressed here is of a greater complexity. The ability to accept context free languages can be applied to a number of practical problems like text processing, speech recognition, etc.

Paper Details

Date Published: 1 March 1992
PDF: 7 pages
Proc. SPIE 1707, Applications of Artificial Intelligence X: Knowledge-Based Systems, (1 March 1992); doi: 10.1117/12.56886
Show Author Affiliations
Sandip Sen, Univ. of Michigan/Ann Arbor (United States)
Janani Janakiraman, Univ. of Michigan/Ann Arbor (United States)


Published in SPIE Proceedings Vol. 1707:
Applications of Artificial Intelligence X: Knowledge-Based Systems
Gautam Biswas, Editor(s)

© SPIE. Terms of Use
Back to Top