Results 91 to 100 of about 171,423 (283)

Base-free Formulas in the Lattice-theoretic Study of Compacta [PDF]

, 2011
The languages of finitary and infinitary logic over the alphabet of bounded lattices have proven to be of considerable use in the study of compacta. Significant among the sentences of these languages are the ones that are base free, those whose truth is ...
Bankston, Paul
core   +1 more source

Patterns of Postictal Abnormalities in Relation to Status Epilepticus in Adults

Annals of Clinical and Translational Neurology, EarlyView.
ABSTRACT Objective Abnormalities on peri‐ictal diffusion‐weighted magnetic resonance imaging (DWI‐PMAs) are well‐established for patients with status epilepticus (SE), but knowledge on patterns of DWI‐PMAs and their prognostic impact is sparse. Methods This systematic review and individual participant data meta‐analysis included observational studies ...
Andrea Enerstad Bolle, Silvana Sarria‐Estrada, Thomas Bonduelle, Bertram Daniel Dynesen, Manuel Toledo, Zhu Chung Che, Kjell Heuser, Anastasios Chatzikonstantinou, Jérôme Aupy, Udaya Seneviratne, Estevo Santamarina Perez, Christoph Patrick Beier   +11 more
wiley   +1 more source

Translation of Conceptual Metaphor of Fear in English into Indonesian and Turkish: A Comparative Study

Prasasti: Journal of Linguistics
In cognitive linguistics, conceptual metaphor is known to reflect the human’s thinking process. Thus, the translation of the conceptual metaphor itself is challenging due to its cultural-bounded lexical.
Hyunisa Rahmanadia, Siti Sa’diah
doaj   +1 more source

On one-way cellular automata with a fixed number of cells [PDF]

, 2003
We investigate a restricted one-way cellular automaton (OCA) model where the number of cells is bounded by a constant number k, so-called kC-OCAs. In contrast to the general model, the generative capacity of the restricted model is reduced to the set of ...
Malcher, Andreas
core  

Rational index of bounded-oscillation languages

CoRR, 2020
The rational index of a context-free language $L$ is a function $f(n)$, such that for each regular language $R$ recognized by an automaton with $n$ states, the intersection of $L$ and $R$ is either empty or contains a word shorter than $f(n)$. It is known that the context-free language (CFL-)reachability problem and Datalog query evaluation for context-
Ekaterina N. Shemetova, Alexander Okhotin, Semyon V. Grigorev   +2 more
openaire   +2 more sources

Value of MRI Outcomes for Preventive and Early‐Stage Trials in Spinocerebellar Ataxias 1 and 3

Annals of Clinical and Translational Neurology, EarlyView.
ABSTRACT Objective To examine the value of MRI outcomes as endpoints for preventive and early‐stage trials of two polyglutamine spinocerebellar ataxias (SCAs). Methods A cohort of 100 participants (23 SCA1, 63 SCA3, median Scale for the Assessment and Rating of Ataxia (SARA) score = 5, 42% preataxic, and 14 gene‐negative controls) was scanned at 3T up ...
Thiago J. R. Rezende, Emilien Petit, Young Woo Park, Sophie Tezenas du Montcel, James M. Joers, Jonathan M. DuBois, H. Moore Arnold, Michal Povazan, Ipek Özdemir, Guita Banan, Romain Valabregue, Philipp Ehses, Jennifer Faber, Chiadi U. Onyike, Peter B. Barker, Jeremy D. Schmahmann, Eva‐Maria Ratai, Sub H. Subramony, Thomas H. Mareci, Khalaf O. Bushara, Henry Paulson, Thomas Klockgether, Alexandra Durr, Tetsuo Ashizawa, Christophe Lenglet, Gülin Öz, READISCA Investigators   +26 more
wiley   +1 more source

On finitely ambiguous B\"uchi automata

, 2018
Unambiguous B\"uchi automata, i.e. B\"uchi automata allowing only one accepting run per word, are a useful restriction of B\"uchi automata that is well-suited for probabilistic model-checking.
A Arnold, A Weber, C Allauzen, C Baier, C Baier, C Courcoubetis, D Isaak, D Kähler, H Karmarkar, H Leung, J-M Couvreur, N Bousquet, RE Stearns, TH Chan, W Thomas   +14 more
core   +1 more source

New bounds for the language compression problem [PDF]

Proceedings 15th Annual IEEE Conference on Computational Complexity, 2002
The CD complexity of a string x is the length of the shortest polynomial time program which accepts only the string x. The language compression problem consists of giving an upper bound on the CD(A/sup /spl les/n/) complexity of all strings x in some set A. The best known upper bound for this problem is 2log(/spl par/A/sup /spl les/n//spl par/)+O(log(n)
Buhrman, H.M., Laplante, S., Bro Miltersen, P.   +2 more
openaire   +3 more sources

FDG‐PET Associations With Disease Severity and Outcomes in NMDA‐Receptor IgG Autoimmune Encephalitis

Annals of Clinical and Translational Neurology, EarlyView.
ABSTRACT Background Patients with N‐methyl‐D‐aspartate (NMDA) receptor‐immunoglobulin G (IgG) autoimmune encephalitis (NMDAR‐IgG AE) demonstrate occipital lobe hypometabolism on baseline brain fluorodeoxyglucose‐positron emission tomography (bFDG‐PET).
Jonathan K. Lee, Jeffrey Lambe, Scott Johnson, Akua Abrah, Jennifer Bullen, Jeffrey A. Cohen, Tatchaporn Ongphichetmetha, Amy Kunchok   +7 more
wiley   +1 more source

A Theory of Formal Synthesis via Inductive Learning

, 2016
Formal synthesis is the process of generating a program satisfying a high-level formal specification. In recent times, effective formal synthesis methods have been proposed based on the use of inductive learning.
Jha, Susmit, Seshia, Sanjit A.
core   +2 more sources