Results 21 to 30 of about 842,589 (329)
Weighted automata with storage
Information and Computation, 2019 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Luisa Herrmann, Heiko Vogler
exaly +3 more sources
Pumping Lemmas for Weighted Automata. [PDF]
, 2018 We present three pumping lemmas for three classes of functions definable by fragments of weighted automata over the min-plus semiring and the semiring of natural numbers. As a corollary we show that the hierarchy of functions definable by unambiguous, finitely-ambiguous, polynomially-ambiguous weighted automata, and the full class of weighted automata ...
Filip Mazowiecki, Cristian Riveros
openaire +4 more sources
Weighted Automata Extraction and Explanation of Recurrent Neural Networks for Natural Language Tasks [PDF]
J. Log. Algebraic Methods Program., 2023 Recurrent Neural Networks (RNNs) have achieved tremendous success in processing sequential data, yet understanding and analyzing their behaviours remains a significant challenge.
Zeming Wei +3 more
semanticscholar +1 more source
Determinisation and Unambiguisation of Polynomially-Ambiguous Rational Weighted Automata [PDF]
Logic in Computer Science, 2023 We study the determinisation and unambiguisation problems of weighted automata over the field of rationals: Given a weighted automaton, can we determine whether there exists an equivalent deterministic, respectively unambiguous, weighted automaton ...
Ismael Jecker +2 more
semanticscholar +1 more source
Logical Methods in Computer Science, 2022 Given two weighted automata, we consider the problem of whether one is big-O of the other, i.e., if the weight of every finite word in the first is not greater than some constant multiple of the weight in the second.
Dmitry Chistikov +3 more
doaj +1 more source
The boundedness and zero isolation problems for weighted automata over nonnegative rationals [PDF]
Logic in Computer Science, 2022 We consider linear cost-register automata (equivalent to weighted automata) over the semiring of nonnegative rationals, which generalise probabilistic automata.
Wojciech Czerwi'nski +4 more
semanticscholar +1 more source
On the Derivational Entropy of Left-to-Right Probabilistic Finite-State Automata and Hidden Markov Models [PDF]
Computational Linguistics, 2017 Probabilistic finite-state automata are a formalism that is widely used in many problems of automatic speech recognition and natural language processing.
Joan Andreu Sánchez +3 more
doaj +2 more sources
Optimal run problem for weighted register automata [PDF]
, 2021 Register automata (RA) are a computational model that can handle data values by adding registers to finite automata. Recently, weighted register automata (WRA) were proposed by extending RA so that weights can be specified for transitions. In this paper,
Takata, Yoshiaki +2 more
core +1 more source
On Determinism and Unambiguity of Weighted Two-way Automata [PDF]
Electronic Proceedings in Theoretical Computer Science, 2014 In this paper, we first study the conversion of weighted two-way automata to one-way automata. We show that this conversion preserves the unambiguity but does not preserve the determinism.
Vincent Carnino, Sylvain Lombardy
doaj +1 more source
Computing the linear hull: Deciding Deterministic? and Unambiguous? for weighted automata over fields [PDF]
Logic in Computer Science, 2022 The (left) linear hull of a weighted automaton over a field is a topological invariant. If the automaton is minimal, the linear hull can be used to determine whether or not the automaton is equivalent to a deterministic one.
J. Bell, Daniel Smertnig
semanticscholar +1 more source