6 search results - page 1 / 2 » A Fast and Simple Algorithm for Constructing Minimal Acyclic... |
JUCS
2002
13 years 4 months ago
2002
: In this paper, we present a fast and simple algorithm for constructing a minimal acyclic deterministic finite automaton from a finite set of words. Such automata are useful in a ...
WIA
2001
Springer
13 years 9 months ago
2001
Springer
Abstract. We present a reflection on the evolution of the different methods for constructing minimal deterministic acyclic finite-state automata from a finite set of words. We ...
WIA
1998
Springer
13 years 9 months ago
1998
Springer
A cover-automaton A of a finite language L is a finite automaton that accepts all words in L and possibly other words that are longer than any word in L. A minimal deterministic co...
STRINGOLOGY
2008
13 years 6 months ago
2008
The class of finite Sturmian words consists of words having particularly simple compressed representation, which is a generalization of the Fibonacci recurrence for Fibonacci word...
ICS
2010
Tsinghua U.
14 years 2 months ago
2010
Tsinghua U.
Computation in the physical world is restricted by the following spatial locality constraint: In a single unit of time, information can only travel a bounded distance in space. A ...