Context free language induction with genetic programming

Author

Dunay, Bertranda Daniel

Author_Institution

Center for Intelligent & Knowledge-Based Syst., New Orleans, LA, USA

fYear

1994

fDate

6-9 Nov 1994

Firstpage

828

Lastpage

831

Abstract

This paper reports on the induction of context free languages using genetic programming. The focus is on language inference, i.e. the inference of formal languages such as those of the Chomsky hierarchy from positive (and negative) sample strings. In this paper, the inference process is extended to the class of context-free grammars. Deterministic pushdown automata are induced from samples of context free languages. The algorithm is a variation of genetic algorithms using free shaped chromosomes to represent the transition tables of the various automata

Keywords

context-free grammars; context-free languages; genetic algorithms; inference mechanisms; pushdown automata; Chomsky hierarchy; context free language induction; context-free grammars; deterministic pushdown automata; formal languages; free shaped chromosomes; genetic programming; inference process; language inference; negative sample strings; positive sample strings; Automata; Automatic programming; Binary trees; Biological cells; Displays; Formal languages; Genetic algorithms; Genetic programming; Testing; Tree data structures;

fLanguage

English

Publisher

ieee

Conference_Titel

Tools with Artificial Intelligence, 1994. Proceedings., Sixth International Conference on

Conference_Location

New Orleans, LA

Print_ISBN

0-8186-6785-0

Type

conf

DOI

10.1109/TAI.1994.346391

Filename

346391