Results 281 to 290 of about 842,589 (329)

The Validity of Weighted Automata

International Journal of Algebra and Computation, 2013
This paper addresses the problem of the validity of weighted automata in which the presence of ε-circuits results in infinite summations. Earlier works either rule out such automata or characterize the semirings in which these infinite sums are all well-defined.By means of a topological approach, we take here a definition of validity that is strong ...
Sylvain Lombardy, Jacques Sakarovitch
openaire   +1 more source

Automata with Auxiliary Weights

International Journal of Foundations of Computer Science, 2016
We introduce a new generalization of weighted automata – automata with auxiliary weights. They allow to compute several quantities not directly computable over semirings by generalizing both semiring addition and semiring multiplication. Moreover, our automata retain key properties of ordinary weighted automata.
Peter Kostolányi, Branislav Rovan
openaire   +2 more sources

Diagnosability of labeled weighted automata over the monoid (ℚ⩾0,+,0)

IEEE Conference on Decision and Control, 2021
In this paper, we characterize diagnosability for a labeled weighted automaton ${{\mathcal{A}}^{{\mathbb{Q}} \geq 0}}$ over the monoid (ℚ⩾0,+,0). By developing a notion of concurrent composition, under a mild assumption that no observable transition is ...
Kuize Zhang, J. Raisch
semanticscholar   +1 more source

On the Determinization of Weighted Automata

J. Autom. Lang. Comb., 2005
Journal of Automata, Languages and Combinatorics, Volume 10, Numbers 2-3, 2005, 287 ...
Daniel Kirsten, Ina Mäurer
openaire   +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

Determinization of Min-Plus Weighted Automata is Decidable

arXiv.org
We show that the determinization problem for min-plus (tropical) weighted automata is decidable, thus resolving this long-standing open problem. In doing so, we develop a new toolbox for analyzing and reasoning about the run-structure of nondeterministic
Shaull Almagor, Guy Arbel, Sarai Sheinvald   +2 more
semanticscholar   +1 more source

Learning Weighted Automata over Number Rings, Concretely and Categorically

Logic in Computer Science
We develop a generic reduction procedure for active learning problems. Our approach is inspired by a recent polynomial-time reduction of the exact learning problem for weighted automata over integers to that for weighted automata over rationals (Buna ...
Quentin Aristote, S. V. Gool, Daniela Petrisan, M. Shirmohammadi   +3 more
semanticscholar   +1 more source

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 Geissler, Tobias Winkler
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

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, Shaowen Miao, Aiwen Lai, Jan Komenda   +3 more
semanticscholar   +1 more source