Results 101 to 110 of about 4,638,570 (374)
The separation problem for regular languages by piecewise testable languages [PDF]
, 2013 Separation is a classical problem in mathematics and computer science. It asks whether, given two sets belonging to some class, it is possible to separate them by another set of a smaller class.
L. Van, M. Zeitoun, Rooijen
core +1 more source
Syntactic structures of regular languages [PDF]
Theoretical Computer Science, 2019 We introduce here the notion of syntactic lattice algebra which is an analogy of the syntactic monoid and of the syntactic semiring. We present a unified approach to get those three structures.
Libor Polák, Ondřej Klíma
openaire +2 more sources
Maximally Atomic Languages [PDF]
Electronic Proceedings in Theoretical Computer Science, 2014 The atoms of a regular language are non-empty intersections of complemented and uncomplemented quotients of the language. Tight upper bounds on the number of atoms of a language and on the quotient complexities of atoms are known.
Janusz Brzozowski, Gareth Davies
doaj +1 more source
Technical Report: Match-reference regular expressions and lenses [PDF]
arXiv, 2022 A lens is a single program that specifies two data transformations at once: one transformation converts data from source format to target format and a second transformation inverts the process. Over the past decade, researchers have developed many different kinds of lenses with different properties.
arxiv
Correspondence of MRI and nTMS With EDSS in Multiple Sclerosis: Longitudinal Follow‐Up Study
Annals of Clinical and Translational Neurology, EarlyView.ABSTRACT Objectives Considering the characteristics of multiple sclerosis (MS) disease and its impact on motor disability, this study aims to assess the functional integrity of the corticospinal tract by examining motor evoked potentials (MEPs), Expanded Disability Status Scale (EDSS) scores, magnetic resonance imaging (MRI) lesion counts, and ...
Antonia Bralić +13 more
wiley +1 more source
Generative Power and Closure Properties of Watson-Crick Grammars
Applied Computational Intelligence and Soft Computing, 2016 We define WK linear grammars, as an extension of WK regular grammars with linear grammar rules, and WK context-free grammars, thus investigating their computational power and closure properties.
Nurul Liyana Mohamad Zulkufli +3 more
doaj +1 more source
Regular tree languages in low levels of the Wadge Hierarchy [PDF]
Logical Methods in Computer Science, 2019 In this article we provide effective characterisations of regular languages of infinite trees that belong to the low levels of the Wadge hierarchy. More precisely we prove decidability for each of the finite levels of the hierarchy; for the class of the ...
Mikołaj Bojańczyk +3 more
doaj +1 more source
ADAPT NXT: Fixed Cycles or Every‐Other‐Week IV Efgartigimod in Generalized Myasthenia Gravis
Annals of Clinical and Translational Neurology, EarlyView.ABSTRACT Objective This phase 3b, open‐label, randomized ADAPT NXT study investigated the efficacy, safety, and tolerability of efgartigimod administered in either a fixed cycles dosing regimen (3 cycles of 4 once‐weekly infusions, with 4 weeks between cycles) or a cycle followed by every‐other‐week (Q2W) dosing.
Ali A. Habib +16 more
wiley +1 more source
Regular Separability of Parikh Automata [PDF]
arXiv, 2016 We investigate a subclass of languages recognized by vector addition systems, namely languages of nondeterministic Parikh automata. While the regularity problem (is the language of a given automaton regular?) is undecidable for this model, we show surprising decidability of the regular separability problem: given two Parikh automata, is there a regular
arxiv
Discontinuation of Immunotherapy in Patients With Relapsing Myelitis Without AQP4/MOG Antibodies
Annals of Clinical and Translational Neurology, EarlyView.ABSTRACT This study assesses the outcomes of immunotherapy discontinuation in patients with relapsing seronegative idiopathic myelitis (SIM), a condition that remains uninvestigated due to its rarity. We reviewed records from 77 patients with relapsing SIM at the National Cancer Center of Korea, focusing on 11 who discontinued treatment after a median ...
Ki Hoon Kim +4 more
wiley +1 more source