Inductive synthesis of cover-grammars with the help of ant colony optimization

DOI10.1515/fcds-2016-0016zbMath1378.68101OpenAlexW2567492100MaRDI QIDQ1692068

Wojciech Wieczorek

Publication date: 26 January 2018

Published in: Foundations of Computing and Decision Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/fcds-2016-0016

zbMATH Keywords

cliquesgrammatical inferenceant colony optimization (ACO)context-free cover-grammar (CFCG)

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Grammars and rewriting systems (68Q42)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Characteristic sets for polynomial grammatical inference
• LARS: a learning algorithm for rewriting systems
• Incremental learning of context free grammars based on bottom-up parsing and search
• The Smallest Grammar Problem
• An algorithm for the decomposition of finite languages
• A method for the inference of non-recursive context-free grammars
• Grammar-based codes: a new class of universal lossless source codes
• Metaheuristics for Hard Optimization
• A generalised normal form theorem for context-free grammars
• On cliques in graphs
• Minimal cover-automata for finite languages

This page was built for publication: Inductive synthesis of cover-grammars with the help of ant colony optimization