Results 211 to 220 of about 1,963,594 (263)
Small and Simple Systems That Favor the Arrow of Time. [PDF]
Entropy (Basel)Chamberlin RV.
europepmc +1 more source
From RNA design to delivery: Computational strategies for functional RNA therapeutics. [PDF]
Bioact MaterWang Y +5 more
europepmc +1 more source
Decidability Boundaries for the Finite-Image Property of Weighted Finite Automata [PDF]
International Journal of Foundations of Computer Science, 2023 A weighted finite automaton has the finite-image property if the image of the weighted language associated with it is finite. We show two undecidability results concerning the finite-image property of weighted finite automata over semirings, respectively strong bimonoids.
Manfred Droste +2 more
exaly +7 more sources
Weighted Finite Automata Over Strong Bimonoids
Information Sciences, 2010 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Heiko Vogler
exaly +5 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
On the Determinization of Weighted Finite Automata
Lecture Notes in Computer Science, 1998We study the problem of constructing the deterministic equivalent of a nondeterministic weighted finite-state automaton (WFA). Determinization of WFAs has important applications in automatic speech recognition (ASR). We provide the first polynomial-time algorithm to test for the twins property, which determines if a WFA admits a deterministic ...
Raffaele Giancarlo, Adam L Buchsbaum
exaly +3 more sources
Image Compression Using Weighted Finite Automata
Lecture Notes in Computer Science, 1993We introduce Weighted Finite Automata (WFA) as a tool to define real functions, in particular, the greyness functions of grey-tone images. Mathematical properties and the definition power of WFA have been studied by Culik and Karhumaki. Their generative power is incomparable with Barnsley's Iterative Function Systems.
Jarkko Kari, Karel Čulík
exaly +3 more sources