5 search results - page 1 / 1 » Exact Generation of Minimal Acyclic Deterministic Finite Aut... |
IJFCS
2008
13 years 6 months ago
2008
JUCS
2002
13 years 6 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 10 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 ...
COLT
2006
Springer
13 years 10 months ago
2006
Springer
Given a finite set of words w1, . . . , wn independently drawn according to a fixed unknown distribution law P called a stochastic language, an usual goal in Grammatical Inference ...
APLAS
2003
ACM
13 years 10 months ago
2003
ACM
We investigate how to automatically verify that resources such as files are not used improperly or unsafely by a program. We employ a mixture of compile-time analysis and run-time ...