Results 51 to 60 of about 2,538 (309)
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
An Infinite Automaton Characterization of Double Exponential Time
Infinite-state automata are a new invention: they are automata that have an infinite number of states represented by words, transitions defined using rewriting, and with sets of initial and final states.
Torre, Salvatore La +7 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
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
Cognitive Behavioral Therapy for Youth With Childhood‐Onset Lupus: A Randomized Clinical Trial
Objective Our objective was to determine the feasibility and acceptability of the Treatment and Education Approach for Childhood‐Onset Lupus (TEACH), a six‐session cognitive behavioral intervention addressing depressive, fatigue, and pain symptoms, delivered remotely to individual youth with lupus by a trained interventionist.
Natoshia R. Cunningham +29 more
wiley +1 more source
Automatic functions, linear time and learning [PDF]
The present work determines the exact nature of {\em linear time computable} notions which characterise automatic functions (those whose graphs are recognised by a finite automaton). The paper also determines which type of linear time notions permit full
John Case +3 more
doaj +1 more source
The Language Theory of Bounded Context-Switching
Concurrent compositions of recursive programs with finite data are a natural abstraction model for concurrent programs. Since reachability is undecidable for this class, a restricted form of reachability has become popular in the formal verification ...
Salvatore La Torre +8 more
core +1 more source
Objective We developed a novel electronic health record sidecar application to visualize key rheumatoid arthritis (RA) outcomes, including disease activity, physical function, and pain, via a patient‐facing graphical interface designed for use during outpatient visits (“RA PRO dashboard”).
Gabriela Schmajuk +16 more
wiley +1 more source
Formal Languages and Finite Automata. Guide for practical lessons [PDF]
Fişierul ataşat conţine: Contents, References. Textul integral al publicaţiei poate fi accesat pe site-ul http://library.utm.md. Accesul prin logare este valabil pentru studenţi, masteranzi, doctoranzi şi cadre didactice UTM.This guide is intended for ...
COJUHARI, Irina +2 more
core
Formal Choreographic Languages [PDF]
We introduce a meta-model based on formal languages, dubbed formal choreographic languages, to study message-passing systems. Our main motivation is to establish a framework for the comparison and generalisation of standard constructions and properties ...
Barbanera F., Lanese I., Tuosto E.
core +1 more source

