15 search results - page 1 / 3 » Weighted finite automata over strong bimonoids |
ISCI
2010
13 years 9 months ago
2010
: We investigate weighted finite automata over strings and strong bimonoids. Such algebraic structures satisfy the same laws as semirings except that no distributivity laws need t...
LATA
2010
Springer
14 years 5 months ago
2010
Springer
Abstract. An important portion of the current research in Description Logics is devoted to the expansion of the reasoning services and the developement of algorithms that can adequ...
CORR
2008
Springer
13 years 11 months ago
2008
Springer
Abstract. We study rational streams (over a field) from a coalgebraic perspective. Exploiting the finality of the set of streams, we present an elementary and uniform proof of the ...
JUCS
2010
13 years 9 months ago
2010
: Generalized finite automata with weights for states and transitions have been successfully applied to image generation for more than a decade now. Bilevel images (black and whit...
DLT
2004
14 years 9 days ago
2004
Bottom-up tree series transducers (tst) over the semiring A are implemented with the help of bottom-up weighted tree automata (wta) over an extension of A. Therefore bottom-up D-w...