Results 21 to 30 of about 4,855,672 (239)
Learning Markov Decision Processes for Model Checking [PDF]
Constructing an accurate system model for formal model verification can be both resource demanding and time-consuming. To alleviate this shortcoming, algorithms have been proposed for automatically learning system models based on observed system ...
Chen, Yingke+5 more
core +3 more sources
Complete axiomatization of algorithmic properties of program schemes with bounded nondeterministic interpretations [PDF]
Propositional algorithmic logic PAL is a propositional counterpart of algorithmic logics. It investigates properties of program connectives: begin...end, while...do, if..then..else, or .... PAL supplies tools for reasoning about programs constructed from program variables by means of program connectives and about their algorithmic properties.
Grażyna Mirkowska
openalex +3 more sources
Nondeterministic quantum computation via ground state cooling and ultrafast Grover algorithm
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 +4 more sources
Nondeterministic Algorithm for Breaking Diffie-Hellman Key Exchange using Self-Assembly of DNA Tiles
The computation based on DNA tile self-assembly has been demonstrated to be scalable, which is consider as a promising technique for computation.
Zheng Cheng
openalex +3 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
Verification of Nondeterministic Quantum Programs [PDF]
Nondeterministic choice is a useful program construct that provides a way to describe the behaviour of a program without specifying the details of possible implementations.
Yuan Feng, Ying Xu
semanticscholar +1 more source
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
Algorithmically Bypassing Censorship on Sina Weibo with Nondeterministic Homophone Substitutions
Like traditional media, social media in China is subject to censorship. However, in limited cases, activists have employed homophones of censored keywords to avoid detection by keyword matching algorithms.
Chaya Hiruncharoenvate+2 more
openalex +3 more sources
Learning Nondeterministic Real-Time Automata
We present an active learning algorithm named NRTALearning for nondeterministic real-time automata (NRTAs). Real-time automata (RTAs) are a subclass of timed automata with only one clock which resets at each transition.
Jie An+3 more
semanticscholar +1 more source