Results 261 to 270 of about 1,475,237 (325)

Scenario-based prediction and optimization of greenspace ecological network under land-use dynamics: a case study of Nanjing metropolitan area, China. [PDF]

Sci Rep
Liu W, Zhao Y, Bai X, Xu H.
europepmc   +1 more source

An efficient uncertainty integrated aggregation scheme for water quality detection and longitudinal carbon offset estimation in the Yamuna River. [PDF]

Sci Rep
Sandhiya M, Bhavithra HA, Sharmila SL, Poongothai S, Haritha M, Devi SS, Kannan K, Menaga A.   +7 more
europepmc   +1 more source

Methodological Insights into Implementing cellular automata models for simulating seagrass dynamics: Responses to global change effects. [PDF]

MethodsX
Beca-Carretero P, Meister M, Teichberg M, Moreira-Saporiti A, Schneekloth F, Reuter H.   +5 more
europepmc   +1 more source

A multiscale stochastic cellular automata model for dispersion of mountain pine beetles. [PDF]

R Soc Open Sci
Liu Y, Estep D.
europepmc   +1 more source

New tile-based circuits converting BCD code to gray, excess-3, and aiken codes in quantum-dot cellular automata (QCA) nanotechnology. [PDF]

Heliyon
Fouladinia F, Gholami M, Karimi P.
europepmc   +1 more source

Blockchain Based Auditable Access Control For Business Processes With Event Driven Policies. [PDF]

IEEE Trans Dependable Secure Comput
Akhtar A, Barati M, Shafiq B, Rana O, Afzal A, Vaidya J, Shamail S.   +6 more
europepmc   +1 more source

Bideterministic Weighted Automata

Information and Computation, 2023
A finite automaton is called bideterministic if it is both deterministic and codeterministic -- that is, if it is deterministic and its transpose is deterministic as well. The study of such automata in a weighted setting is initiated.
Peter Kostolányi
semanticscholar   +6 more sources

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.
Alessandro Giua, Sébastien Lahaye, Aiwen Lai   +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, C. Ikenmeyer
semanticscholar   +2 more sources