Results 41 to 50 of about 45,230 (224)
Unifying B\"uchi Complementation Constructions [PDF]
Complementation of B\"uchi automata, required for checking automata containment, is of major theoretical and practical interest in formal verification. We consider two recent approaches to complementation.
Seth J. Fogarty +3 more
doaj +1 more source
We introduce a class of algebras that can be used as recognisers for regular tree languages. We show that it is the only such class that forms a pseudo-variety and we prove the existence of syntactic algebras.
Achim Blumensath
doaj +1 more source
Complete Symmetry in D2L Systems and Cellular Automata [PDF]
We introduce completely symmetric D2L systems and cellular automata by means of an additional restriction on the corresponding symmetric devices. Then we show that completely symmetric D2L systems and cellular automata are still able to simulate Turing ...
Asveld, Peter R.J.
core +5 more sources
Graph Logics with Rational Relations [PDF]
We investigate some basic questions about the interaction of regular and rational relations on words. The primary motivation comes from the study of logics for querying graph topology, which have recently found numerous applications.
Pablo Barcelo +2 more
doaj +1 more source
Towards Nominal Formal Languages [PDF]
We introduce formal languages over infinite alphabets where words may contain binders. We define the notions of nominal language, nominal monoid, and nominal regular expressions.
Kurz, Alexander +2 more
core +2 more sources
Remote Monitoring in Myasthenia Gravis: Exploring Symptom Variability
ABSTRACT Background Myasthenia gravis (MG) is a rare, autoimmune disorder characterized by fluctuating muscle weakness and potential life‐threatening crises. While continuous specialized care is essential, access barriers often delay timely interventions. To address this, we developed MyaLink, a telemedical platform for MG patients.
Maike Stein +13 more
wiley +1 more source
Regular Cost Functions, Part I: Logic and Algebra over Words [PDF]
The theory of regular cost functions is a quantitative extension to the classical notion of regularity. A cost function associates to each input a non-negative integer value (or infinity), as opposed to languages which only associate to each input the ...
Thomas Colcombet
doaj +1 more source
A Bibliography on Fuzzy Automata, Grammars and Lanuages [PDF]
This bibliography contains references to papers on fuzzy formal languages, the generation of fuzzy languages by means of fuzzy grammars, the recognition of fuzzy languages by fuzzy automata and machines, as well as some applications of fuzzy set theory ...
Asveld, Peter R.J.
core +2 more sources
Reachability in Higher-Order-Counters
Higher-order counter automata (\HOCS) can be either seen as a restriction of higher-order pushdown automata (\HOPS) to a unary stack alphabet, or as an extension of counter automata to higher levels.
A. Bouajjani +11 more
core +1 more source
ABSTRACT Objective Considerable efforts have been dedicated to developing effective treatments for post‐stroke executive impairment (PSEI), among which repetitive transcranial magnetic stimulation (rTMS) has shown great potential. This study aimed to investigate the therapeutic effects of high‐frequency rTMS on working memory (WM) and response ...
Mengting Lao +6 more
wiley +1 more source

