In the paper we study the induction of minimal nondeterministic finite automata consistent
with the sets of examples and counterexamples. The induced automata are minimal with …

The present paper is a novel contribution to the field of bioinformatics by using grammatical
inference in the analysis of data. We developed an algorithm for generating star‐free regular …

In order to define a DNF version of first-order sentences over strings in which atomic
sentences represent substring properties of strings, we use results of the Ehrenfeucht …

In this paper an algorithm for the induction of a context-free grammar is proposed, and its
application in obtaining a generating function for the number of certain combinatorial objects …

We define a propositional substring logic (PS) in which atomic sentences represent
substring properties of strings. We also investigate the following variation of the boolean …

We investigate the following problem: given a sample of classified strings, find a first-order
sentence of minimal quantifier rank that is consistent with the sample. We represent strings …

The grammatical inference community has been studying evolutionary methods for DFA
learning for almost three decades. These methods typically operate by learning a …

We present a method to extract knowledge in terms of quantifier-free first-order sentences in
disjunctive normal form from noisy samples of classified strings. We show that the problem to …

In this chapter an algorithm for the induction of a Directed Acyclic Word Graph (DAWG) is
proposed. A DAWG can serve as a very efficient data structure for lexicon representation …

We present a method to extract knowledge in terms of quantifier-free sentences in
disjunctive normal form from noisy samples of classified strings. We show that the problem to …