In this paper, we describe a new method for constructing minimal, deterministic, acyclic finite-
state automata from a set of strings. Traditional methods consist of two phases: the first to …

This paper deals with the effective implementation of the new Czech morphological analyser
ajka which is based on the algorithmic description of the Czech formal morphology. First, we …

Chain reduction enables reduced ordered binary decision diagrams (BDDs) and zero-
suppressed binary decision diagrams (ZDDs) to each take advantage of the others' ability to …

In this article we present SMES–SPPC, a high–performance system for intelligent extraction
of structured data from free text documents. SMES–SPPC consists of a set of domain …

In this paper, we deal with minimization of finite automata associated with finite languages
all the words have the same length. This problem arises in the context of Constraint …

In this paper a handwritten recognition algorithm based on structural characteristics,
histograms and profiles, is presented. The well-known horizontal and vertical histograms are …

In order to analyze some extremal cases of Hopcroft's algorithm, we investigate the
relationships between the combinatorial properties of a circular sturmian word (x) and the …

Minimization of deterministic finite automata is a largely studied problem of the Theory of
Automata and Formal Languages. It consists in finding the unique (up to isomorphism) …

We present a semi-incremental algorithm for constructing minimal acyclic deterministic finite
automata. Such automata are useful for storing sets of words for spell-checking, among …

We present sppc, a high-performance system for intelligent text extraction and navigation
from German free text documents. sppc consists of a set of domainindependent shallow core …