Results 111 to 120 of about 4,638,570 (374)

Separating Regular Languages by Locally Testable and Locally Threshold Testable Languages

Foundations of Software Technology and Theoretical Computer Science, 2013
A separator for two languages is a third language containing the first one and disjoint from the second one. We investigate the following decision problem: given two regular input languages, decide whether there exists a locally testable (resp. a locally
Thomas Place, L. V. Rooijen, M. Zeitoun
semanticscholar   +1 more source

CSF Biomarker‐Based Cognitive Trajectories in Parkinson's Disease‐Subjective Cognitive Decline

Annals of Clinical and Translational Neurology, EarlyView.
ABSTRACT Objective Cognitive complaints without objective cognitive impairment in Parkinson's Disease, termed Parkinson's Disease‐Subjective Cognitive Decline (PD‐SCD), have been associated with cognitive decline. However, its progression is heterogeneous, highlighting the need for improved identification of patients at greater risk for deterioration ...
Jon Rodriguez‐Antiguedad, Arnau Puig‐Davi, Iñigo Ruíz‐Barrio, Javier Pagonabarraga, Anna Vázquez‐Oliver, Andrea Horta‐Barba, Jaime Kulisevsky, Saül Martínez‐Horta   +7 more
wiley   +1 more source

Regular realizability problems and context-free languages

, 2015
We investigate regular realizability (RR) problems, which are the problems of verifying whether intersection of a regular language -- the input of the problem -- and fixed language called filter is non-empty. In this paper we focus on the case of context-
A Yakaryılmaz, J Berstel, J Berstel, L Boasson, L Boasson, L Pierre, L Pierre, MN Vyalyi, MN Vyalyi, R Greenlaw, SA Greibach, T Anderson   +11 more
core   +1 more source

Expressiveness and Closure Properties for Quantitative Languages [PDF]

Logical Methods in Computer Science, 2010
Weighted automata are nondeterministic automata with numerical weights on transitions. They can define quantitative languages~$L$ that assign to each word~$w$ a real number~$L(w)$.
Krishnendu Chatterjee, Laurent Doyen, Thomas A Henzinger   +2 more
doaj   +1 more source

On the State Complexity of the Reverse of R- and J-trivial Regular Languages [PDF]

arXiv, 2013
The tight upper bound on the state complexity of the reverse of R-trivial and J-trivial regular languages of the state complexity n is 2^{n-1}. The witness is ternary for R-trivial regular languages and (n-1)-ary for J-trivial regular languages. In this paper, we prove that the bound can be met neither by a binary R-trivial regular language nor by a J ...
arxiv  

Precision‐Optimised Post‐Stroke Prognoses

Annals of Clinical and Translational Neurology, EarlyView.
ABSTRACT Background Current medicine cannot confidently predict who will recover from post‐stroke impairments. Researchers have sought to bridge this gap by treating the post‐stroke prognostic problem as a machine learning problem, reporting prediction error metrics across samples of patients whose outcomes are known.
Thomas M. H. Hope, Howard Bowman, Rachel M. Bruce, Alex P. Leff, Cathy J. Price   +4 more
wiley   +1 more source

Quotient Complexities of Atoms of Regular Languages

, 2012
An atom of a regular language L with n (left) quotients is a non-empty intersection of uncomplemented or complemented quotients of L, where each of the n quotients appears in a term of the intersection.
Brzozowski, Janusz, Tamm, Hellis
core   +1 more source

On Concatenations of Regular Circular Word Languages

Mathematics
In this paper, one-wheel and two-wheel concatenations of circular words and their languages are investigated. One-wheel concatenation is an operation that is commutative but not associative, while two-wheel concatenation is associative but not ...
Bilal Abdallah, Benedek Nagy
doaj   +1 more source

Deciding Regularity of Hairpin Completions of Regular Languages in Polynomial Time [PDF]

arXiv, 2011
The hairpin completion is an operation on formal languages that has been inspired by the hairpin formation in DNA biochemistry and by DNA computing. In this paper we investigate the hairpin completion of regular languages. It is well known that hairpin completions of regular languages are linear context-free and not necessarily regular. As regularity
arxiv  

A New Notion of Regularity: Finite State Automata Accepting Graphs [PDF]

EPTCS 407, 2024, pp. 5-26
Analogous to regular string and tree languages, regular languages of directed acyclic graphs (DAGs) are defined in the literature. Although called regular, those DAG-languages are more powerful and, consequently, standard problems have a higher complexity than in the string case.
arxiv   +1 more source