Results 71 to 80 of about 81,118 (297)
The Design of a Verified Derivative-Based Parsing Tool for Regular Expressions
CLEI Electronic Journal, 2021 We describe the formalization of Brzozowski and Antimirov derivative based algorithms for regular expression parsing, in the dependently typed language Agda.
Elton Cardoso +5 more
doaj +1 more source
Diversity and complexity in neural organoids
FEBS Letters, EarlyView.Neural organoid research aims to expand genetic diversity on one side and increase tissue complexity on the other. Chimeroids integrate multiple donor genomes within single organoids. Self‐organising multi‐identity organoids, exogenous cell seeding, or enforced assembly of region‐specific organoids contribute to tissue complexity.
Ilaria Chiaradia, Madeline A. Lancaster
wiley +1 more source
Colloquium Exactarum, 2014 This article defines the formal definition of the computer program language Numeric Regular Expression. A language concept inspired by Regular Expression syntax, applying your power and flexibility to numeric chains are describe.
Bruno Vier Hoffmeister, Marta Bez
doaj +1 more source
A novel algorithm for the conversion of shuffle regular expressions into non-deterministic finite automata [PDF]
Maejo International Journal of Science and Technology, 2013 Regular expressions with shuffle operators are widely used in diverse fields of computer science. The work presented here investigates the shuffling of regular expressions and their conversion into non-deterministic finite automata.
Ajay Kumar, Anil Kumar Verma
doaj +1 more source
Hyperosmotic stress induces PARP1‐mediated HPF1‐dependent mono(ADP‐ribosyl)ation
FEBS Letters, EarlyView.Sorbitol‐induced hyperosmotic stress rapidly induces reversible mono(ADP‐ribosyl)ation (MARylation) on PARP1 without the signs of genotoxic signaling. We show that PARP1 autoMARylation is HPF1 dependent and forms hydroxylamine‐resistant O‐glycosidic linkages.
Anna Georgina Kopasz +11 more
wiley +1 more source
On Practical Regular Expressions
CoRR, 2014 We report on simulation, hierarchy, and decidability results for Practical Regular Expressions (PRE), which may include back references in addition to the standard operations union, concatenation, and star. The following results are obtained: PRE can be simulated by the classical model of nondeterministic finite automata with sensing one-way heads. The
openaire +2 more sources
The ubiquitin ligase RNF115 is required for the clearance of damaged lysosomes
FEBS Letters, EarlyView.Upon lysosomal rupture, an E3 ubiquitin ligase RNF115 translocates from the cytosol to the damaged lysosomal membrane. Moreover, RNF115 depletion impairs the clearance of damaged lysosomes, identifying it as a key regulator of lysosomal quality control.
Sae Nakanaga +3 more
wiley +1 more source
Games for Succinctness of Regular Expressions
, 2021 We present a version of so called formula size games for regular expressions. These games characterize the equivalence of languages up to expressions of a given size.
Vilander, Miikka
core +1 more source
FEBS Letters, EarlyView.Septin 9 polybasic domains couple phosphoinositide‐rich membrane binding to centrosome positioning, Golgi organization, and microtubule acetylation to control epithelial polarity. Their loss disrupts this axis, causing centrosome mispositioning, Golgi fragmentation, reduced microtubule acetylation, and polarity inversion via upregulation of the ...
Ting ting Cai +4 more
wiley +1 more source
Implementation of forkable regular expressions [PDF]
, 2018 Větvící regulární výrazy jsou regulární výrazy rozšířené o unární operátor Fork. Tento operátor přidává souběžnou složku k výrazům. Cílem práce je tyto Větvící regulární výrazy implementovat, aby se daly využít k analýze paralelních programů.
Sochor Miroslav
core