Results 41 to 50 of about 1,772,421 (241)
Opacity with Orwellian Observers and Intransitive Non-interference [PDF]
, 2013 Opacity is a general behavioural security scheme flexible enough to account for several specific properties. Some secret set of behaviors of a system is opaque if a passive attacker can never tell whether the observed behavior is a secret one or not ...
Mullins, John, Yeddes, Moez
core +1 more source
Theoretical Computer Science, 1987 AbstractWe characterize here the free partially commutative monoids the regular sets of which form a Boolean algebra or are all unambiguous: these are, in both cases, the free products of free commutative monoids. This result has been established independently by other authors but the method used here is original.
openaire +2 more sources
Dynamic Membership for Regular Languages
, 2021 We study the dynamic membership problem for regular languages: fix a language L, read a word w, build in time O(|w|) a data structure indicating if w is in L, and maintain this structure efficiently under letter substitutions on w. We consider this problem on the unit cost RAM model with logarithmic word length, where the problem always has a solution ...
Amarilli, Antoine +2 more
openaire +4 more sources
Loss of proton‐sensing GPR4 reduces tumor progression in mouse models of colon cancer
Molecular Oncology, EarlyView.G protein‐coupled receptor 4 (GPR4) is a pH‐sensing receptor activated by acidic pH. GPR4 expression is increased in patients with inflammatory bowel disease who are at high risk of developing colorectal cancer. In mouse models, loss of GPR4 attenuated tumor progression. This correlated with increased IL2 and natural killer cell activity.
Leonie Perren +16 more
wiley +1 more source
On the periodicity of regular languages
Information and Control, 1979 A subclass of regular languages called periodic languages and the corresponding finite automata having nontrivial periodic structure are characterized in this paper. Canonical forms of the regular expressions representing such periodic languages are presented.
openaire +2 more sources
Regular languages and partial commutations
Information and Computation, 2013 The first author was supported by the project Automatas en dispositivos moviles: interfaces de usuario y realidad aumentada (PAID 2019-06-11) supported by Universidad Politecnica de Valencia. The third author was supported by the project ANR 2010 BLAN 0202 02 FREC.
Cano, Antonio +2 more
openaire +2 more sources
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
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
On Store Languages of Language Acceptors
, 2018 It is well known that the "store language" of every pushdown automaton -- the set of store configurations (state and stack contents) that can appear as an intermediate step in accepting computations -- is a regular language.
Ibarra, Oscar H., McQuillan, Ian
core +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