Results 71 to 80 of about 3,110 (267)
Finite Automata and Randomness [PDF]
, 2018 The lecture surveys approaches using finite automata to define several notions of (automata-theoretic) randomness.
openaire +2 more sources
On Finitely Ambiguous Büchi Automata [PDF]
, 2018 Unambiguous Büchi automata, i.e. Büchi automata allowing only one accepting run per word, are a useful restriction of Büchi automata that is well-suited for probabilistic model-checking. In this paper we propose a more permissive variant, namely finitely ambiguous Büchi automata, a generalisation where each word has at most $k$ accepting runs, for some
Christof Löding, Anton Pirogov
openaire +3 more sources
Advanced Functional Materials, EarlyView.This review establishes structure‐property‐mechanism relationships across six modification strategies for V‐based oxide water‐splitting electrocatalysts: lattice engineering, heteroatom doping, interface engineering, carbon‐based hybridization, morphology engineering, and surface reconstruction and pre‐catalyst design, where dissolution is reframed as ...
Youness El Issmaeli +4 more
wiley +1 more source
Advanced Functional Materials, EarlyView.Rapid thermal annealing reconstructs the BCFO/Nb:STO interface into an atomically thin reconstructed interfacial layer, which reshapes the tunneling barrier and converts a high‐TER ferroelectric tunnel junction into an intrinsically nonlinear, self‐rectifying device.
Hojin Lee +21 more
wiley +1 more source
Self-assembling Finite Automata [PDF]
, 2002 We investigate a model of self-assembling finite automata. An automaton is assembled on demand during its computation from copies out of a finite set of items. These items are pieces of a finite automaton which are connected to the already assembled automaton by identifying states.
Klein, Andreas +2 more
openaire +3 more sources
Advanced Functional Materials, EarlyView.The effects of solid‐state electrolyte architecture and electrolyte/electrode interfacial polarization resistance on Critical Current Density and the risks for “interfacial” and “internal” Li‐metal dendrite formation were investigated in simulations of FIB‐reconstructed porous‐dense Li7La3Zr2O12 (LLZO) “bilayers”, providing insight for full cells ...
Tanner R. Hamann +2 more
wiley +1 more source
Finite Automata Implementations Considering CPU Cache
Acta Polytechnica, 2007 The finite automata are mathematical models for finite state systems. More general finite automaton is the nondeterministic finite automaton (NFA) that cannot be directly used.
J. Holub
doaj
Advanced Materials, EarlyView.ABSTRACT The accelerating expansion of data‐centric technologies is sharply increasing the energy burden of information storage, placing unprecedented pressure on the efficiency of magnetic switching. Conventional field‐driven reversal, once the foundation of magnetic memory, has become impractical in modern architectures due to its high energy cost ...
Mohammad H. Badarneh +2 more
wiley +1 more source
Finite Automata Capturing Winning Sequences for All Possible Variants of the PQ Penny Flip Game
Mathematics, 2018 The meticulous study of finite automata has produced many important and useful results. Automata are simple yet efficient finite state machines that can be utilized in a plethora of situations. It comes, therefore, as no surprise that they have been used
Theodore Andronikos +5 more
doaj +1 more source
Robust finite automata in stochastic chemical reaction networks. [PDF]
R Soc Open Sci, 2021 Arredondo D, Lakin MR.
europepmc +1 more source