Results 91 to 100 of about 4,638,570 (374)
Molecular Oncology, EarlyView.Analysis of treatment‐naïve high‐grade serous ovarian carcinoma (HGSOC) and control tissues for ERVs, LINE‐1 (L1), inflammation, and immune checkpoints identified five clusters with diverse patient recurrence‐free survivals. An inflammation score was calculated and correlated with retroelement expression, where one novel cluster (Triple‐I) with high ...
Laura Glossner +6 more
wiley +1 more source
An Automata Theoretic Approach to the Zero-One Law for Regular Languages: Algorithmic and Logical Aspects [PDF]
Electronic Proceedings in Theoretical Computer Science, 2015 A zero-one language L is a regular language whose asymptotic probability converges to either zero or one. In this case, we say that L obeys the zero-one law.
Ryoma Sin'ya
doaj +1 more source
Asymptotic Approximation by Regular Languages [PDF]
arXiv, 2020 This paper investigates a new property of formal languages called REG-measurability where REG is the class of regular languages. Intuitively, a language \(L\) is REG-measurable if there exists an infinite sequence of regular languages that "converges" to \(L\).
arxiv
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.Human cytomegalovirus infection is common in normal prostate epithelium, prostate tumor tissue, and prostate cancer cell lines. CMV promotes cell survival, proliferation, and androgen receptor signaling. Anti‐CMV pharmaceutical compounds in clinical use inhibited cell expansion in prostate cancer models in vitro and in vivo, motivating investigation ...
Johanna Classon +13 more
wiley +1 more source
Regular component decomposition of regular languages
Theoretical Computer Science, 2003 AbstractA language is regular if it can be recognized by a finite automaton. According to the pumping lemma, every infinite regular language contains a regular subset of the form uv+w, where u,v,w are words and v is not empty. It is known that every regular language can be expressed as (⋃i∈Iuivi+wi)∪F, where I is an index set, ui,wi∈A∗,vi∈A+,i∈I and F ...
openaire +2 more sources
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
Crime Against History: Slavery, Race, and the 1776 Report
New Directions for Adult and Continuing Education, EarlyView.ABSTRACT With the 2025 executive order, “Ending Radical Indoctrination in K‐12 Schooling,” the Trump administration reestablished the 1776 Commission, which produced The 1776 Report. This article argues that this report, which is an unsubtle response to The 1619 Project, reveals how White Christian Nationalists wish to mandate that a hyper‐patriotic ...
William V. Trollinger
wiley +1 more source
Nonterminal complexity of some families of infinite regular languages [PDF]
arXiv, 2021 Nonterminal complexity of a context-free language is the smallest possible number of nonterminals in its generating grammar. While in general case nonterminal complexity computation problem is unsolvable, it can be computed for different families of regular languages.
arxiv
Energy dependence of the GAFCHROMIC LD‐V1 in the diagnostic radiographic modalities
Journal of Applied Clinical Medical Physics, EarlyView.Abstract The GAFCHROMIC LD‐V1 radiochromic film is widely used in dosimetry because it can provide high‐resolution two‐dimensional dose distributions without processing. This study aimed to evaluate the response characteristics at different effective energies, from the low‐energy range of mammography to the high‐energy range of computed tomography. Net
Tatsuhiro Gotanda +9 more
wiley +1 more source