Results 281 to 290 of about 1,475,237 (325)

Weighted Automata for Exact Inference in Discrete Probabilistic Programs

International Colloquium on Theoretical Aspects of Computing
In probabilistic programming, the inference problem asks to determine a program's posterior distribution conditioned on its"observe"instructions. Inference is challenging, especially when exact rather than approximate results are required.
Dominik Geißler, Tobias Winkler
semanticscholar   +1 more source

Weighted restarting automata

Soft Computing, 2016
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Friedrich Otto, Qichao Wang
openaire   +1 more source

Simulating Weighted Automata over Sequences and Trees with Transformers

International Conference on Artificial Intelligence and Statistics
Transformers are ubiquitous models in the natural language processing (NLP) community and have shown impressive empirical successes in the past few years.
M. Rizvi, M. Lizaire, Clara Lacroce, Guillaume Rabusseau   +3 more
semanticscholar   +1 more source

Verification of initial-and-final-state opacity for unambiguous weighted automata.

ISA transactions
Initial-and-final-state opacity (IFO) is a type of opacity that characterizes a system's ability to prevent the disclosure of information about whether its evolution starts at an initial state and ends at a final state.
Liren Shen, Shao-Wen Miao, Aiwen Lai, Jan Komenda   +3 more
semanticscholar   +1 more source

Weighted automata with discounting

Information Processing Letters, 2008
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Manfred Droste, Jacques Sakarovitch, Heiko Vogler   +2 more
openaire   +2 more sources

Factoring through monomial representations: arithmetic characterizations and ambiguity of weighted automata

arXiv.org
We characterize group representations that factor through monomial representations, respectively, block-triangular representations with monomial diagonal blocks, by arithmetic properties.
Antoni Puch, Daniel Smertnig
semanticscholar   +1 more source

Learning Weighted Automata

2015
Weighted finite automata (WFA) are finite automata whose transitions and states are augmented with some weights, elements of a semiring. A WFA induces a function over strings. The value it assigns to an input string is the semiring sum of the weights of all paths labeled with that string, where the weight of a path is obtained by taking the semiring ...
Borja Balle, Mehryar Mohri
openaire   +1 more source

Stochastization of Weighted Automata

2015
Nondeterministic weighted finite automata (WFAs) map input words to real numbers. Each transition of a WFA is labeled by both a letter from some alphabet and a weight. The weight of a run is the sum of the weights on the transitions it traverses, and the weight of a word is the minimal weight of a run on it.
Guy Avni, Orna Kupferman
openaire   +1 more source

A Disambiguation Algorithm for Weighted Automata

Theoretical Computer Science, 2017
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mehryar Mohri
exaly   +2 more sources

On the determinization of weighted finite automata

SIAM Journal on Computing, 1998
Summary: We 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 ...
Adam L. Buchsbaum, Raffaele Giancarlo, Jeffery R. Westbrook   +2 more
openaire   +2 more sources