Results 101 to 110 of about 752,176 (316)
Rewriting extended regular expressions
We consider an extended algebra of regular events (languages) with intersection besides the usual operations. This algebra has the structure of a distributive lattice with monotonic operations; the latter property is crucial for some applications. We give a new complete Horn equational axiomatization of the algebra and develop some term-rewriting ...
Antimirov, Valentin M., Mosses, Peter D.
openaire +2 more sources
This study investigated how PYCR1 inhibition in bone marrow stromal cells (BMSCs) indirectly affects multiple myeloma (MM) cell metabolism and viability. Culturing MM cells in conditioned medium from PYCR1‐silenced BMSCs impaired oxidative phosphorylation and increased sensitivity to bortezomib.
Inge Oudaert +13 more
wiley +1 more source
Following high dose rate brachytherapy (HDR‐BT) for hepatocellular carcinoma (HCC), patients were classified as responders and nonresponders. Post‐therapy serum induced increased BrdU incorporation and Cyclin E expression of Huh7 and HepG2 cells in nonresponders, but decreased levels in responders.
Lukas Salvermoser +14 more
wiley +1 more source
Disambiguation of Regular Expressions with Backreferences via Term Rewriting
In this paper we focus on regular expressions with acyclic backreferences and treat them as a semiring satisfying certain theorems of Kleene algebra. Using these theorems as term rewriting rules, we introduce an algorithm for memory disambiguation of ...
Daria N. Ismagilova +1 more
doaj +1 more source
Regular binoid expressions and regular binoid languages
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hashiguchi, Kosaburo +2 more
openaire +1 more source
A synthetic benzoxazine dimer derivative targets c‐Myc to inhibit colorectal cancer progression
Benzoxazine dimer derivatives bind to the bHLH‐LZ region of c‐Myc, disrupting c‐Myc/MAX complexes, which are evaluated from SAR analysis. This increases ubiquitination and reduces cellular c‐Myc. Impairing DNA repair mechanisms is shown through proteomic analysis.
Nicharat Sriratanasak +8 more
wiley +1 more source
Regularity preserving modifications of regular expressions
This paper is concerned with the problem of determining whether a set of sequences R\t', obtained by some given rule from a regular set of sequences R, is again a regular set. A number of such problems are solved in this paper and a basic technique is used which is easy to apply to problems of this type.
Stearns, R.E., Hartmanis, J.
openaire +1 more source
Towards Nominal Formal Languages [PDF]
We introduce formal languages over infinite alphabets where words may contain binders. We define the notions of nominal language, nominal monoid, and nominal regular expressions.
Kurz, Alexander +2 more
core +2 more sources
Efficient recognition of a class of context-sensitive languages described by Augmented Regular Expressions [PDF]
Alberto Sanfeliu, René Alquézar
openalex +1 more source

