Results 51 to 60 of about 3,411 (291)

Sublinearly space bounded iterative arrays [PDF]

open access: yes, 2007
Iterative arrays (IAs) are a, parallel computational model with a sequential processing of the input. They are one-dimensional arrays of interacting identical deterministic finite automata.
B.S. Palano   +5 more
core  

Robustness in Timed Automata [PDF]

open access: yes, 2013
In this paper we survey several approaches to the robustness of timed automata, that is, the ability of a system to resist to slight perturbations or errors.
Markey, Nicolas   +7 more
core   +1 more source

Natural Frequencies of Levodopa‐Induced Dyskinesia in Parkinson's Disease

open access: yesAnnals of Clinical and Translational Neurology, EarlyView.
ABSTRACT Objectives Abnormal involuntary movements, known as dyskinesias, are common complications of levodopa treatment in patients with Parkinson's disease and can significantly impair quality of life. The underlying pathophysiology remains unclear, and current therapeutic options are limited.
Ioannis U. Isaias   +3 more
wiley   +1 more source

Minimizing finite automata is computationally hard [PDF]

open access: yes, 2002
It is known that deterministic finite automata (DFAs) can be algorithmically minimized, i.e., a DFA M can be converted to an equivalent DFA M' which has a minimal number of states. The minimization can be done efficiently [6].
Malcher, Andreas
core  

Global Rather Than Vertical‐Selective Saccadic Abnormalities in Progressive Supranuclear Palsy

open access: yesAnnals of Clinical and Translational Neurology, EarlyView.
ABSTRACT Objective To test whether vertical saccades are preferentially affected in Progressive Supranuclear Palsy (PSP). Methods PSP patients (n = 24) were compared to age‐matched controls (n = 94) and two degenerative groups (Alzheimer's disease, n = 20; Lewy body disease, n = 50).
Duy Duan Nguyen   +6 more
wiley   +1 more source

Performance analysis of probabilistic timed automata using digital clocks [PDF]

open access: yes, 2006
Probabilistic timed automata, a variant of timed automata extended with discrete probability distributions, is a modelling formalism suitable for describing formally both nondeterministic and probabilistic aspects of real-time systems, and is amenable to
Kwiatkowska, M.   +4 more
core   +1 more source

Integrating Patient‐Reported Quality Measures in Systemic Lupus Erythematosus: Development of the American College of Rheumatology Implementation Guide

open access: yesArthritis Care &Research, EarlyView.
Objective To support high‐quality, patient‐centered care for systemic lupus erythematosus (SLE), the American College of Rheumatology (ACR) developed evidence‐based measures incorporating clinical and patient‐reported outcome measures (PROMs). Using the Consolidated Framework for Implementation Research (CFIR), we conducted semistructured interviews ...
Catherine Nasrallah   +13 more
wiley   +1 more source

Formal Languages and Finite Automata. Guide for practical lessons [PDF]

open access: yes, 2022
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   +1 more source

From Adult to Adolescent: Alignment in Clinical Trials and Outcomes in Axial Spondyloarthritis

open access: yesArthritis Care &Research, EarlyView.
Spondyloarthritis (SpA) is a group of chronic inflammatory diseases encompassing axial and peripheral forms, with up to 20% of patients developing symptoms before age 16. Despite this substantial pediatric burden, treatment options for juvenile‐onset SpA (JSpA), particularly those with axial disease (axJSpA), remain limited.
Pamela F. Weiss   +9 more
wiley   +1 more source

Fresh-Register Automata [PDF]

open access: yes, 2011
What is a basic automata-theoretic model of computation with names and fresh-name generation? We introduce Fresh-Register Automata (FRA), a new class of automata which operate on an infinite alphabet of names and use a finite number of registers to store
Tzevelekos, N, Nikos Tzevelekos
core   +1 more source

Home - About - Disclaimer - Privacy