Results 71 to 80 of about 14,469 (313)
Finite Sequentiality of Finitely Ambiguous Max-Plus Tree Automata [PDF]
, 2020 We show that the finite sequentiality problem is decidable for finitely ambiguous max-plus tree automata. A max-plus tree automaton is a weighted tree automaton over the max-plus semiring.
Paul, Erik
core +1 more source
Advanced Materials, EarlyView.This work reports a direct, biocompatible method to synthesize UiO‐66, enabling one‐step encapsulation of proteins without compromising crystallinity or activity. Using advanced in situ and ex situ techniques, the study reveals that proteins integrate concurrently with MOF growth, forming crystalline protein@UiO‐66 nanoparticles, and provide insight ...
Jesús Cases Díaz +5 more
wiley +1 more source
Stochastic Timed Automata [PDF]
Logical Methods in Computer Science, 2014 A stochastic timed automaton is a purely stochastic process defined on a timed automaton, in which both delays and discrete choices are made randomly.
Nathalie Bertrand +6 more
doaj +1 more source
Efficient Detection of Zeno Runs in Timed Automata [PDF]
, 2007 Zeno runs, where infinitely many actions occur in finite time, may inadvertently arise in timed automata specifications. Zeno runs may compromise the reliability of formal verification, and few model-checkers provide the means to deal with them: this ...
Gomez, Rodolfo, Bowman, Howard
core +1 more source
Inverse Design of Amorphous Materials With Targeted Properties
Advanced Materials, EarlyView.AMDEN is a diffusion model framework for the inverse design of amorphous materials with targeted properties. By incorporating Hamiltonian Monte Carlo refinement into the denoising process, the framework overcomes the challenge of generating thermally relaxed disordered structures.
Jonas A. Finkler +4 more
wiley +1 more source
From LIDL(m) to Timed Automata [PDF]
, 2009 LIDL(m) is a decidable fragment of Interval Duration Logic with Located Constraints, an expressive subset of dense-time Duration Calculus. It has been claimed that, for any LIDL(m) formula D, a timed automaton can be constructed which accepts the models ...
Gomez, Rodolfo
core
Advanced Materials, EarlyView.A giant insulator to metal transition and emergent superparamagnetism are revealed by nanoparticle exsolution in non‐stoichiometric titanate perovskite thin films. By combining transport, synchrotron spectroscopy, and first‐principles calculations, this work reveals how defect reconfiguration and lattice reconstruction fundamentally reshape electronic ...
Sungil Kim +11 more
wiley +1 more source
Alternating, private alternating, and quantum alternating realtime automata [PDF]
Logical Methods in Computer Science, 2019 We present new results on realtime alternating, private alternating, and quantum alternating automaton models. Firstly, we show that the emptiness problem for alternating one-counter automata on unary alphabets is undecidable.
Gökalp Demirci +4 more
doaj +1 more source
Advanced Materials, EarlyView.This review summarizes the principles and challenges of nonaqueous lithium‐oxygen batteries and recent advances in cathode catalysts, including carbon‐based materials, metals, oxides, sulfides, nitrides, carbides, and redox mediators. It highlights emerging design strategies and artificial intelligence‐driven approaches, emphasizing data‐assisted ...
Yuqing Yao +8 more
wiley +1 more source
Enumeration of minimal acyclic automata via generalized parking functions [PDF]
Discrete Mathematics & Theoretical Computer Science, 2015 We give an exact enumerative formula for the minimal acyclic deterministic finite automata. This formula is obtained from a bijection between a family of generalized parking functions and the transitions functions of acyclic automata.
Jean-Baptiste Priez
doaj +1 more source