Results 271 to 280 of about 842,589 (329)

The Tsetlin Machine: A "Third Way" in QSAR Modeling. [PDF]

J Chem Inf Model
Clarke PFA, Cmelo I, Helin R, Shende MK, Granmo OC, Fayne D.   +5 more
europepmc   +1 more source

GIS and cellular automata based slope rainwater movement process model and its application. [PDF]

Sci Rep
Liu L, Chen Y, Zhang Y, Lian Z, Pei L, Liu Y.   +5 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Verification of Detectability for Unambiguous Weighted Automata

IEEE Transactions on Automatic Control, 2021
In this article, we deal with the detectability problem for unambiguous weighted automata (UWAs). The problem is to determine if, after a finite number of observations, the set of possible states is reduced to a singleton.
Aiwen Lai, Sébastien Lahaye, Alessandro Giua   +2 more
exaly   +2 more sources

Functional Closure Properties of Finite ℕ-weighted Automata [PDF]

International Colloquium on Automata, Languages and Programming
We determine all functional closure properties of finite $\mathbb{N}$-weighted automata, even all multivariate ones, and in particular all multivariate polynomials.
Julian Dörfler, Christian Ikenmeyer
semanticscholar   +2 more sources

Quantitative vs. Weighted Automata

Reachability Problems, 2021
Weighted automata are widely researched, but with a variety of different semantics, which mostly fit into either the “quantitative view” or the “algebraic view”. We argue that the two views result with incomparable automata families, each providing a different conceptual generalization of Boolean automata and having different natural extensions.
Udi Boker
openaire   +2 more sources

Weighted automata

Handbook of Automata Theory, 2021
Manfred Droste, Dietrich Kuske
openaire   +2 more sources

Weighted Automata and Logics Meet Computational Complexity

Information and Computation, 2023
Complexity 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, 2023
This 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
Shaowen Miao, Aiwen Lai, Xiao Yu, S. Lahaye, J. Komenda   +4 more
semanticscholar   +1 more source