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...
Weighted automata are nondeterministic automata with numerical weights on transitions. They can define quantitative languages L that assign to each word w a real number L(w). In ...
Krishnendu Chatterjee, Laurent Doyen, Thomas A. He...
A text is a word together with an additional linear order on it. We study quantitative models for texts, i.e. text series which assign to texts elements of a semiring. We introduc...
We introduce a routing mechanism, referred to as algorithmic routing. It is a viable routing alternative for network simulations with minimal space complexity
Motivated by a question on the zeros of irreducible characters of the symmetric and alternating groups, we classify partitions which are of maximal p-weight for all odd primes p.