<abstract xmlns="http://www.w3.org/1999/xhtml"><p> 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.</p></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.

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

Faculty of Computer Science and Materials Science, University of Silesia,

Foundations of Computing and Decision Sciences

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.

{"article-title":"Inductive Synthesis of Cover-Grammars with the Help of Ant Colony Optimization"}

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...

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

Online veröffentlicht: 13. Dez. 2016

Seitenbereich: 297 - 315

Eingereicht: 21. Apr. 2016

Akzeptiert: 22. Sept. 2016

DOI: https://doi.org/10.1515/fcds-2016-0016

Schlüsselwörter
context-free cover-grammar (CFCG), grammatical inference, Ant Colony Optimization (ACO), cliques

© by Wojciech Wieczorek

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.

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

Online veröffentlicht: 13. Dez. 2016

Seitenbereich: 297 - 315

Eingereicht: 21. Apr. 2016

Akzeptiert: 22. Sept. 2016

DOI: https://doi.org/10.1515/fcds-2016-0016

Schlüsselwörtercontext-free cover-grammar (CFCG), grammatical inference, Ant Colony Optimization (ACO), cliques

© by Wojciech Wieczorek

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.

Schlüsselwörter
context-free cover-grammar (CFCG), grammatical inference, Ant Colony Optimization (ACO), cliques