Results 231 to 240 of about 1,963,594 (263)
Some of the next articles are maybe not open access.
Weighted Finite Automata: Computing with Different Topologies
2011We use a very conventional model of computation to define unconventional computational processes. This leads to an easily computable class of real functions, however, this class is very different to those of nicely behaving real functions in a classical sense.
Juhani Karhumäki, Turo Sallinen
openaire +3 more sources
Weighted Finite Automata and Metrics in Cantor Space
J. Autom. Lang. Comb., 2003We show how weighted finite automata define topologies on the set of all $\omega$-words over a finite alphabet $X$. Moreover, we give a characterization of these topologies in terms of topologies on $X^\omega$ induced by languages $U\subseteq X^*$.
openaire +2 more sources
Efficient Simulation of Nondeterministic Weighted Finite Automata
J. Autom. Lang. Comb., 2004Simulation of nondeterministic automata is often required in algorithms for string matching and image compression. We give three algorithms for NWFA simulation and compare them with known methods. When we consider the problem of computing the acceptance weight of all words of a given finite length, we find that the best of the three algorithms is ...
openaire +3 more sources
Properties and Applications of Parametric Weighted Finite Automata
J. Autom. Lang. Comb., 2005Journal of Automata, Languages and Combinatorics, Volume 10, Numbers 2-3, 2005, 347 ...
openaire +1 more source
Refining image compression with weighted finite automata
Proceedings of Data Compression Conference - DCC '96, 2002Weighted finite automata (WFA) generalize finite automata by attaching real numbers as weights to states and transitions. As shown by Culik and Kari (1994, 1995) WFA provide a powerful tool for image generation and compression. The inference algorithm for WFA subdivides an image into a set of nonoverlapping range images and then separately approximates
openaire +1 more source
On Generalizations of Weighted Finite Automata and Graphics Applications
2007Already computations of ordinary finite automata can be interpreted as discrete grayscale or colour images. Input words are treated as addresses of pixel-components in a very natural way. In this well understood context already meaningful operations on images like zooming or self-similarity can be formally introduced.
Jürgen Albert, German Tischler
openaire +2 more sources
Video compression with weighted finite automata
Proceedings DCC '97. Data Compression Conference, 1997Summary form only given. Weighted finite automata (WFA) exploit self-similarities within single images and also video streams to remove spatial and temporal redundancies. The WFA image codec combines techniques from fractal image compression and vector-quantization to achieve performance results for low bit-rates which can be put on a par with state-of-
J. Albert, S. Frank, U. Hafner, M. Unger
openaire +1 more source
Image and video coding with weighted finite automata
Proceedings of International Conference on Image Processing, 2002Weighted finite automata (WFA) exploit self similarities within single pictures and also sequences of pictures to remove spatial and temporal redundancies. Due to their simple mathematical structure, WFA provide an ideal platform for efficient hybrid compression methods. We present a new coding algorithm that hierarchically compounds adjacent ranges to
openaire +1 more source
Algorithms for Weighted Finite Automata with Failure Transitions
2018In this paper we extend several weighted finite automata (WFA) algorithms to automata with failure transitions (\(\varphi \)-WFAs). Failure transitions, which are taken only when no immediate match is possible at a given state, are used to compactly represent automata and have many applications.
Cyril Allauzen, Michael D. Riley
openaire +2 more sources
An Approximate Determinization Algorithm for Weighted Finite-State Automata
Algorithmica, 2001zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Adam L. Buchsbaum +2 more
exaly +4 more sources