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 the language. In this paper, we describe an efficient algorithm aided by Ant Colony System that, for a given finite language, synthesizes (c...
שמור ב:
| מחבר ראשי: | |
|---|---|
| פורמט: | Artigo |
| שפה: | Inglês |
| יצא לאור: |
Sciendo
2016-11-01
|
| סדרה: | Foundations of Computing and Decision Sciences |
| נושאים: | |
| גישה מקוונת: | https://doi.org/10.1515/fcds-2016-0016 |
| תגים: |
אין תגיות, היה/י הראשונ/ה לתייג את הרשומה!
|