495 search results - page 32 / 99 » Automata and differentiable words |
WIA
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. Hopcroft’s algorithm for minimizing a deterministic automaton has complexity O(n log n). We show that this complexity bound is tight. More precisely, we provide a famil...
DLT
2003
13 years 9 months ago
2003
In recent years generalized acceptance criteria for different nondeterministic computation models have been examined. Instead of the common definition where an input word is said...
NAACL
2003
2003
Syntax-based Alignment of Multiple Translations: Extracting Paraphrases and Generating New Sentences
13 years 9 months ago
We describe a syntax-based algorithm that automatically builds Finite State Automata (word lattices) from semantically equivalent translation sets. These FSAs are good representat...
COLING
2002
13 years 7 months ago
2002
In this paper, we present a rich semantic network based on a differential analysis. We then detail implemented measures that take into account common and differential features bet...
CSC
2006
13 years 9 months ago
2006
In this paper, a new method is proposed in order to evaluate the stochastic solution of linear random differential equation. The method is based on the combination of the probabili...