Results 71 to 80 of about 4,664,026 (360)
The Magic Number Problem for Subregular Language Families [PDF]
Electronic Proceedings in Theoretical Computer Science, 2010 We investigate the magic number problem, that is, the question whether there exists a minimal n-state nondeterministic finite automaton (NFA) whose equivalent minimal deterministic finite automaton (DFA) has alpha states, for all n and alpha satisfying n
Markus Holzer +2 more
doaj +1 more source
A Trichotomy for Regular Simple Path Queries on Graphs [PDF]
, 2012 Regular path queries (RPQs) select nodes connected by some path in a graph. The edge labels of such a path have to form a word that matches a given regular expression.
Bagan, Guillaume +2 more
core +2 more sources
Liquid biopsy epigenetics: establishing a molecular profile based on cell‐free DNA
Molecular Oncology, EarlyView.Cell‐free DNA (cfDNA) fragments in plasma from cancer patients carry epigenetic signatures reflecting their cells of origin. These epigenetic features include DNA methylation, nucleosome modifications, and variations in fragmentation. This review describes the biological properties of each feature and explores optimal strategies for harnessing cfDNA ...
Christoffer Trier Maansson +2 more
wiley +1 more source
Regular binoid expressions and regular binoid languages
Theoretical Computer Science, 2003 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hashiguchi, Kosaburo +2 more
openaire +1 more source
Next‐generation proteomics improves lung cancer risk prediction
Molecular Oncology, EarlyView.This is one of very few studies that used prediagnostic blood samples from participants of two large population‐based cohorts. We identified, evaluated, and validated an innovative protein marker model that outperformed an established risk prediction model and criteria employed by low‐dose computed tomography in lung cancer screening trials.
Megha Bhardwaj +4 more
wiley +1 more source
Regular Languages Are Church-Rosser Congruential [PDF]
International Colloquium on Automata, Languages and Programming, 2012 This article shows a general result about finite monoids and weight reducing string rewriting systems. As a consequence it proves a long standing conjecture in formal language theory: All regular languages are Church-Rosser congruential.
V. Diekert +3 more
semanticscholar +1 more source
Molecular Oncology, EarlyView.The cancer problem is increasing globally with projections up to the year 2050 showing unfavourable outcomes in terms of incidence and cancer‐related deaths. The main challenges are prevention, improved therapeutics resulting in increased cure rates and enhanced health‐related quality of life.
Ulrik Ringborg +43 more
wiley +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
Learning Regular Languages Using RFSA
Theoretical Computer Science, 2001 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Denis, François +2 more
openaire +2 more sources
LDAcoop: Integrating non‐linear population dynamics into the analysis of clonogenic growth in vitro
Molecular Oncology, EarlyView.Limiting dilution assays (LDAs) quantify clonogenic growth by seeding serial dilutions of cells and scoring wells for colony formation. The fraction of negative wells is plotted against cells seeded and analyzed using the non‐linear modeling of LDAcoop.
Nikko Brix +13 more
wiley +1 more source