Results 271 to 280 of about 1,475,237 (325)
Some of the next articles are maybe not open access.
Quantitative vs. Weighted Automata
Lecture Notes in Computer Science, 2021Udi Boker
exaly +2 more sources
Weighted Automata and Logics Meet Computational Complexity
Information and Computation, 2023Complexity classes such as $\#\mathbf{P}$, $\oplus\mathbf{P}$, $\mathbf{GapP}$, $\mathbf{OptP}$, $\mathbf{NPMV}$, or the class of fuzzy languages realised by polynomial-time fuzzy nondeterministic Turing machines, can all be described in terms of a class
Peter Kostol'anyi
semanticscholar +1 more source
Verification of Detectability for Unambiguous Weighted Automata Using Self-Composition
International Conference on Control, Decision and Information Technologies, 2023This paper aims to explore the problem of verifying detectability for unambiguous weighted automata (UWAs) through the utilization of modified self-composition. Specifically, we focus on two types of detectability: strong periodic detectability (SPD) and
Shao-Wen Miao +4 more
semanticscholar +1 more source
The Validity of Weighted Automata
International Journal of Algebra and Computation, 2013This 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 +2 more sources
Weighted Tree Automata and Weighted Logics
Theoretical Computer Science, 2006 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Heiko Vogler
exaly +2 more sources
Automata with Auxiliary Weights
International Journal of Foundations of Computer Science, 2016We 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 +3 more sources
On the Determinization of Weighted Automata
J. Autom. Lang. Comb., 2005Journal of Automata, Languages and Combinatorics, Volume 10, Numbers 2-3, 2005, 287 ...
Daniel Kirsten, Ina Mäurer
openaire +2 more sources
Diagnosability of labeled weighted automata over the monoid (ℚ⩾0,+,0)
IEEE Conference on Decision and Control, 2021In 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 ...
Kui-Ze Zhang, J. Raisch
semanticscholar +1 more source
Determinization of Min-Plus Weighted Automata is Decidable
arXiv.orgWe 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 +2 more
semanticscholar +1 more source