513 search results - page 4 / 103 » Finitely Based, Finite Sets of Words |
CORR
2008
Springer
13 years 7 months ago
2008
Springer
For a stationary stochastic process {Xn} with values in some set A, a finite word w AK is called a memory word if the conditional probability of X0 given the past is constant on t...
ASPDAC
2007
ACM
14 years 13 days ago
2007
ACM
Abstract: This paper presents an approach to area optimization of arithmetic datapaths that perform polynomial computations over bit-vectors with finite widths. Examples of such de...
FSMNLP
2005
Springer
14 years 1 months ago
2005
Springer
TAGH is a system for automatic recognition of German word forms. It is based on a stem lexicon with allomorphs and a concatenative mechanism for inflection and word formation. Wei...
JSCIC
2008
13 years 8 months ago
2008
In this paper we shall discuss the numerical simulation of higher order geometric flows by level set methods. Main examples under considerations are surface diffusion and the Will...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
This article studies the expressive power of finite automata recognizing sets of real numbers encoded in positional notation. We consider Muller automata as well as the restricted ...