Results 291 to 300 of about 109,516 (325)
Some of the next articles are maybe not open access.
Unambiguity in Automata Theory
2015Determinism of devices is a key aspect throughout all of computer science, simply because of considerations of efficiency of the implementation. One possible way (among others) to relax this notion is to consider unambiguous machines: non-deterministic machines that have at most one accepting run on each input.
openaire +1 more source
Automata Theory and Formal Theory Languages
2022In this book we present some basic notions and results on Automata Theory, Formal Language Theory, Computability Theory, and Parsing Theory. In particular, we consider the class of regular languages which are related to the class of finite automata, and the class of the context-free languages which are related to the class of pushdown automata. For the
openaire +2 more sources
Poly(ADP-Ribose) polymerase (PARP) inhibitors: Exploiting a synthetic lethal strategy in the clinic
Ca-A Cancer Journal for Clinicians, 2011Timothy A Yap, Johann Sebastian de Bono
exaly
Computational predictions of energy materials using density functional theory
Nature Reviews Materials, 2016Anubhav Jain +2 more
exaly
Theory-guided design of catalytic materials using scaling relationships and reactivity descriptors
Nature Reviews Materials, 2019Zhi-Jian Zhao, Sihang Liu, Shenjun Zha
exaly