Inductive Synthesis of Cover-Grammars with the Help of Ant Colony Optimization

Abstract

A cover-grammar of a finite language is a context-free grammar that accepts all words in the language and possibly other words that are longer than any word in the language. In this paper, we describe an efficient algorithm aided by Ant Colony System that, for a given finite language, synthesizes (constructs) a small cover-grammar of the language. We also check its ability to solve a grammatical inference task through the series of experiments.

Keywords

• context-free cover-grammar (cfcg)
• grammatical inference
• ant colony optimization (aco)
• cliques