Results 21 to 30 of about 1,475,237 (325)
Efficient Completion of Weighted Automata [PDF]
Electronic Proceedings in Theoretical Computer Science, 2016 We consider directed graphs with edge labels from a semiring. We present an algorithm that allows efficient execution of queries for existence and weights of paths, and allows updates of the graph: adding nodes and edges, and changing weights of ...
Johannes Waldmann
doaj +4 more sources
Probabilistic Weighted Automata [PDF]
, 2009 Nondeterministic weighted automata are finite automata with numerical weights on transitions. They define quantitative languages L that assign to each word w a real number L(w). The value of an infinite word w is computed as the maximal value of all runs over w, and the value of a run as the maximum, limsup, liminf, limit average, or discounted sum of ...
Chatterjee, Krishnendu +2 more
openaire +9 more sources
Adding Pebbles to Weighted Automata [PDF]
, 2012 We extend weighted automata and weighted rational expressions with 2-way moves and (reusable) pebbles. We show with examples from natural language modeling and quantitative model-checking that weighted expressions and automata with pebbles are more expressive and allow much more natural and intuitive specifications than classical ones. We extend Kleene-
Gastin, Paul, Monmege, Benjamin
openaire +3 more sources
Approximation of Weighted Automata with Storage [PDF]
Electronic Proceedings in Theoretical Computer Science, 2017 We use a non-deterministic variant of storage types to develop a framework for the approximation of automata with storage. This framework is used to provide automata-theoretic views on the approximation of multiple context-free languages and on coarse ...
Tobias Denkinger
doaj +5 more sources
Aperiodic Weighted Automata and Weighted First-Order Logic [PDF]
International Symposium on Mathematical Foundations of Computer Science, 2019 By fundamental results of Sch\"utzenberger, McNaughton and Papert from the 1970s, the classes of first-order definable and aperiodic languages coincide. Here, we extend this equivalence to a quantitative setting.
M. Droste, P. Gastin
semanticscholar +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
A Nivat Theorem for Weighted Alternating Automata over Commutative Semirings [PDF]
Logical Methods in Computer Science, 2023 This paper connects the classes of weighted alternating finite automata (WAFA), weighted finite tree automata (WFTA), and polynomial automata (PA). First, we investigate the use of trees in the run semantics for weighted alternating automata and prove ...
Gustav Grabolle
doaj +1 more source
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
Coalgebras for Bisimulation of Weighted Automata over Semirings [PDF]
Logical Methods in Computer Science, 2023 Weighted automata are a generalization of nondeterministic automata that associate a weight drawn from a semiring $K$ with every transition and every state.
Purandar Bhaduri
doaj +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 ...
Ismaël Jecker +2 more
semanticscholar +1 more source