Results 221 to 230 of about 1,963,594 (263)
Some of the next articles are maybe not open access.
On computational power of weighted finite automata
Fundamenta Informaticae, 1992Weighted Finite Automata are automata with multiplicities used to compute real functions by reading infinite words. The aim of this paper is to study what kind of functions can be computed by level automata, a particular subclass of WFA. Several results concerning the continuity and the smoothness of these functions are shown.
Denis Derencourt +3 more
openaire +2 more sources
On Finite and Polynomial Ambiguity of Weighted Tree Automata
Lecture Notes in Computer Science, 2016We consider finite and polynomial ambiguity of weighted tree automata. Concerning finite ambiguity, we show that a finitely ambiguous weighted tree automaton can be decomposed into a sum of unambiguous automata. For polynomial ambiguity, we show how to decompose a polynomially ambiguous weighted tree automaton into simpler polynomially ambiguous ...
Erik Paul
exaly +3 more sources
Undecidability in Integer Weighted Finite Automata
Fundamenta Informaticae, 1999It is shown that the universe problem L(Aγ) = A* is undecidable for 4-state finite automata A with integer weight function γ on its transitions. This holds even in the case, where A is acyclic and the weighting γ satisfies the unimodality condition. The language L(Aγ) is defined as the set of words ω for which there exists a path π of A having zero ...
Vesa Halava, Tero Harju
openaire +2 more sources
Weighted finite automata for video compression
IEEE Journal on Selected Areas in Communications, 1998Weighted finite automata (WFA) exploit self-similarities within single pictures and also sequences of pictures to remove spatial and temporal redundancies. Their implementation then combines techniques from hierarchical methods related to quadtrees and from vector quantization to achieve performance results for low bit rates which can be put on a par ...
Ullrich Hafner +3 more
openaire +1 more source
From Regular Weighted Expressions to Finite Automata
International Journal of Foundations of Computer Science, 2003In this article we generalize concepts of the position automaton and ZPC-structure to the regular [Formula: see text]-expressions. We show that the extended ZPC-structure can be built in linear time w.r.t. the size of the [Formula: see text]-expression and that the associated position automaton can be deduced from it in quadratic time.
Jean-Marc Champarnaud +3 more
openaire +3 more sources
Determinization of Finite State Weighted Tree Automata
J. Autom. Lang. Comb., 2003Journal of Automata, Languages and Combinatorics, Volume 8, Number 3, 2003, 417 ...
Björn Borchardt, Heiko Vogler
openaire +2 more sources
Weighted Two-Dimensional Finite Automata
2019Two-dimensional finite automata (\(\textsf {2D}\text {-}\textsf {FA}\)) are a natural generalization of finite automata to two-dimension and used to recognize picture languages. In order to study quantitative aspects of computations of \(\textsf {2D}\text {-}\textsf {FA}\), we introduce weighted two-dimensional finite automata (\(\textsf {W2D}\text {-}\
Qichao Wang, Yongming Li 0001, Wei Zhou
openaire +2 more sources
Quasi-Distances and Weighted Finite Automata
2015We show that the neighbourhood of a regular language \(L\) with respect to an additive quasi-distance can be recognized by an additive weighted finite automaton (WFA). The size of the WFA is the same as the size of an NFA (nondeterministic finite automaton) for \(L\) and the construction gives an upper bound for the state complexity of a neighbourhood ...
Timothy Ng 0001 +2 more
openaire +2 more sources
STATE COMPLEXITY OF ADDITIVE WEIGHTED FINITE AUTOMATA
International Journal of Foundations of Computer Science, 2007It is known that the neighborhood of a regular language with respect to an additive distance is regular. We introduce an additive weighted finite automaton model that provides a conceptually simple way to reprove this result. We consider the state complexity of converting additive weighted finite automata to deterministic finite automata.
Kai Salomaa, Paul N. Schofield
openaire +2 more sources
Determinization of Weighted Finite Automata Over Strong Bimonoids
Information Sciences, 2010zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Miroslav Ciric +2 more
exaly +4 more sources