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

Pełny rekord metadanych

DC pole	Wartość	Język
dc.contributor.author	Wieczorek, Wojciech	-
dc.date.accessioned	2017-11-29T18:56:02Z	-
dc.date.available	2017-11-29T18:56:02Z	-
dc.date.issued	2016	-
dc.identifier.citation	Foundations of Computing and Decision Sciences, Vol 41, iss. 4 (2016), s. 297-315	pl_PL
dc.identifier.issn	0867-6356	-
dc.identifier.uri	http://hdl.handle.net/20.500.12128/498	-
dc.description.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.	pl_PL
dc.language.iso	en	pl_PL
dc.rights	Uznanie autorstwa-Użycie niekomercyjne-Bez utworów zależnych 3.0 Polska	*
dc.rights.uri	http://creativecommons.org/licenses/by-nc-nd/3.0/pl/	*
dc.subject	Ant Colony Optimization (ACO)	pl_PL
dc.subject	Cliques	pl_PL
dc.subject	Context-free cover-grammar (CFCG)	pl_PL
dc.subject	Grammatical inference	pl_PL
dc.title	Inductive Synthesis of Cover-Grammars with the Help of Ant Colony Optimization	pl_PL
dc.type	info:eu-repo/semantics/article	pl_PL
dc.relation.journal	Foundations of Computing and Decision Sciences	pl_PL
dc.identifier.doi	10.1515/fcds-2016-0016	-
Pojawia się w kolekcji:	Artykuły (WNŚiT)

Uznanie autorstwa - użycie niekomercyjne, bez utworów zależnych 3.0 Polska Creative Commons