Nondeterministic quantum computation via ground state cooling and ultrafast Grover algorithm [PDF]
Over the last decades, there have been many proposals for quantum computation. One of the promising candidates is adiabatic quantum computation (AQC). The central idea of AQC is about finding the ground state of a system with a problem Hamiltonian via particular adiabatic passages, starting from an initialized ground state of a simple Hamiltonian.
P. V. Pyshkin +3 more
openalex +3 more sources
Efficient algorithms for hard problems in nondeterministic tree automata
We present PTIME language-preserving techniques for the reduction of non-deterministic tree automata, both for the case of finite trees and for infinite trees. Our techniques are based on new transition removing and state merging results, which rely on binary relations that compare the downward and upward behaviours of states in the automaton.
Ricardo Almeida
openalex +2 more sources
Minimization and Canonization of GFG Transition-Based Automata [PDF]
While many applications of automata in formal methods can use nondeterministic automata, some applications, most notably synthesis, need deterministic or good-for-games (GFG) automata.
Bader Abu Radi, Orna Kupferman
doaj +1 more source
Mathematical Modeling of Amoxicillin Synthesis in Batch and Semi-Batch Reactor: Application of Bayesian Statistics and Genetic Algorithm. [PDF]
Synthesis of amoxicillin: The reaction catalyzed by penicillin G acylase is investigated in an enzymatic reactor, considering both Michaelis–Menten and mechanism‐based models with reaction and equilibrium constants. Parameters are estimated via MCMC and Genetic Algorithm, with MCMC showing superior performance in validating the mathematical model in a ...
Formigosa LF +5 more
europepmc +2 more sources
Residuality and Learning for Nondeterministic Nominal Automata [PDF]
We are motivated by the following question: which data languages admit an active learning algorithm? This question was left open in previous work by the authors, and is particularly challenging for languages recognised by nondeterministic automata.
Joshua Moerman, Matteo Sammartino
doaj +1 more source
Non Deterministic Zero Divisor Graph
A non-deterministic zero divisor graph refers to an element in a ring or algebraic structure that can multiply with another element to give zero, but the specific outcome of the multiplication is not uniquely determined.
Shakila Banu, Naveena Selvaraj
doaj +1 more source
Distinguishing sequences are widely used in finite state machine-based conformance testing to solve the state identification problem. In this paper, we address the scalability issue encountered while deriving distinguishing sequences from complete ...
Bilal Elghadyry +3 more
doaj +1 more source
The μ-Calculus Model-Checking Algorithm for Generalized Possibilistic Decision Process
Model checking is a formal automatic verification technology for complex concurrent systems. It is used widely in the verification and analysis of computer software and hardware systems, communication protocols, security protocols, etc.
Jiulei Jiang, Panqing Zhang, Zhanyou Ma
doaj +1 more source
Fair Simulation for Nondeterministic and Probabilistic Buechi Automata: a Coalgebraic Perspective [PDF]
Notions of simulation, among other uses, provide a computationally tractable and sound (but not necessarily complete) proof method for language inclusion.
Natsuki Urabe, Ichiro Hasuo
doaj +1 more source
Spatiotemporal Reservoir Computing with a Reconfigurable Multifunctional Memristor Array. [PDF]
This study presents a hardware physical reservoir computing system using a tri‐modal memristive crossbar array. Stochastic masking, bistable nonlinear activation, and analog readout enable fully in‐memory spatiotemporal processing. Demonstrations on cellular automata, Lorenz prediction, ADHD EEG classification, and chaotic KS modeling highlight its ...
Kim S +10 more
europepmc +2 more sources

