39 search results - page 4 / 8 » Lattice Automata |
EMNLP
2008
13 years 8 months ago
2008
We present Minimum Bayes-Risk (MBR) decoding over translation lattices that compactly encode a huge number of translation hypotheses. We describe conditions on the loss function t...
CAV
2006
Springer
13 years 11 months ago
2006
Springer
We propose and evaluate a new algorithm for checking the universality of nondeterministic finite automata. In contrast to the standard algorithm, which uses the subset construction...
JUCS
2002
13 years 7 months ago
2002
: By introducing a new operation, the exponentiation of formal languages, we can define Heyting algebras of formal languages. It turns out that some well known families of language...
DNA
2005
Springer
14 years 26 days ago
2005
Springer
Recent experimental progress in DNA lattice construction, DNA robotics, and DNA computing provides the basis for designing DNA cellular computing devices, i.e. autonomous nano-mech...
ACRI
2004
Springer
14 years 22 days ago
2004
Springer
Abstract. We outline the basic principles of neuropercolation, a generalized percolation model motivated by the dynamical properties of the neuropil, the densely interconnected neu...