60 search results - page 5 / 12 » On Generalizations of Weighted Finite Automata and Graphics ... |
FOSSACS
2011
Springer
12 years 11 months ago
2011
Springer
Traditional automata accept or reject their input, and are therefore Boolean. In contrast, weighted automata map each word to a value from a semiring over a large domain. The speci...
TCS
2008
13 years 7 months ago
2008
This paper studies a novel paradigm for learning formal languages from positive and negative examples which consists of mapping strings to an appropriate highdimensional feature s...
MEDES
2009
ACM
14 years 4 days ago
2009
ACM
The main goal of web pages ranking is to find the interrelated pages. In this paper, we introduce an algorithm called FPR-DLA. In the proposed method learning automata is assigned...
ACL
2003
13 years 8 months ago
2003
Recent text and speech processing applications such as speech mining raise new and more general problems related to the construction of language models. We present and describe in...
GECCO
2007
Springer
14 years 1 months ago
2007
Springer
With resemblance of finite-state machines to some biological mechanisms in cells and numerous applications of finite automata in different fields, this paper uses analogies an...