Results 91 to 100 of about 889,414 (343)
Some Properties of Brzozowski Derivatives of Regular Expressions [PDF]
arXiv, 2014 Brzozowski derivatives of a regular expression are developed for constructing deterministic automata from the given regular expression in the algebraic way. In this paper,some lemmas of the regular expressions are discussed and the regular languages of the derivatives are illustrated. Also the generalizations of the Brzozowski derivatives are proved as
arxiv
Molecular Oncology, EarlyView.Urine is a rich source of biomarkers for cancer detection. Tumor‐derived material is released into the bloodstream and transported to the urine. Urine can easily be collected from individuals, allowing non‐invasive cancer detection. This review discusses the rationale behind urine‐based cancer detection and its potential for cancer diagnostics ...
Birgit M. M. Wever +1 more
wiley +1 more source
Symbolic Solving of Extended Regular Expression Inequalities [PDF]
arXiv, 2014 This paper presents a new solution to the containment problem for extended regular expressions that extends basic regular expressions with intersection and complement operators and consider regular expressions on infinite alphabets based on potentially infinite character sets.
arxiv
A General Framework for the Derivation of Regular Expressions
, 2012 The aim of this paper is to design a theoretical framework that allows us to perform the computation of regular expression derivatives through a space of generic structures.
Caron, Pascal +2 more
core +2 more sources
Molecular Oncology, EarlyView.Cancer‐associated fibroblasts (CAFs) promote cancer growth, invasion (metastasis), and drug resistance. Here, we identified functional and diverse circulating CAFs (cCAFs) in patients with metastatic prostate cancer (mPCa). cCAFs were found in higher numbers and were functional and diverse in mPCa patients versus healthy individuals, suggesting their ...
Richell Booijink +6 more
wiley +1 more source
Novel NFA engine construction method of regular expressions
Tongxin xuebao, 2014 A novel method for constructing smaller non-deterministic finite automata (NFA) engine from given regular expressions named PFA was proposed.There are three main algorithms in PFA,the pretreatment algorithm,the coding parser tree algorithm and the NFA ...
Mao-hua JING +3 more
doaj +2 more sources
Position Automata for Kleene Algebra with Tests [PDF]
Scientific Annals of Computer Science, 2012 Kleene algebra with tests (KAT) is an equational system that combines Kleene and Boolean algebras. One can model basic programming constructs and assertions in KAT, which allowed for its application in compiler optimization, program transformation and ...
A. Silva
doaj +1 more source
Succinctness of the Complement and Intersection of Regular Expressions [PDF]
Dans Proceedings of the 25th Annual Symposium on the Theoretical
Aspects of Computer Science - STACS 2008, Bordeaux : France (2008), 2008 We study the succinctness of the complement and intersection of regular expressions. In particular, we show that when constructing a regular expression defining the complement of a given regular expression, a double exponential size increase cannot be avoided. Similarly, when constructing a regular expression defining the intersection of a fixed and an
arxiv
On the Uniform Distribution of Regular Expressions [PDF]
arXiv, 2021 Although regular expressions do not correspond univocally to regular languages, it is still worthwhile to study their properties and algorithms. For the average case analysis one often relies on the uniform random generation using a specific grammar for regular expressions, that can represent regular languages with more or less redundancy.
arxiv
Regular Expressions for Humanists [PDF]
, 2017 A getting started guide on regular expressions for humanities ...
Eve, Martin Paul
core