6 research outputs found
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 (constructs) a small cover-grammar of the language. We also check its ability to solve a grammatical inference task through the series of experiments
Decomposing Finite Languages
The paper completely characterizes the primality of acyclic DFAs, where a DFA
is prime if there do not exist DFAs
with such that each
has strictly less states than the minimal DFA recognizing the same language as
. A regular language is prime if its minimal DFA is prime. Thus,
this result also characterizes the primality of finite languages.
Further, the -completeness of the corresponding decision problem
is proven. The paper also characterizes the
primality of acyclic DFAs under two different notions of compositionality,
union and union-intersection compositionality.
Additionally, the paper introduces the notion of S-primality, where a DFA
is S-prime if there do not exist DFAs
with such that each
has strictly less states than itself. It is proven that the
problem of deciding S-primality for a given DFA is -hard. To do
so, the -completeness of , the basic problem
of deciding minimality for a DFA with at most two letters, is proven