Results 81 to 90 of about 7,287,958 (273)
Regular binoid expressions and regular binoid languages
Theoretical Computer Science, 2003 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Shuji Jimbo +2 more
openaire +2 more sources
Boundedness in languages of infinite words
, 2017 We define a new class of languages of $\omega$-words, strictly extending $\omega$-regular languages. One way to present this new class is by a type of regular expressions.
Bojańczyk, Mikołaj, Colcombet, Thomas
core +1 more source
Minimizing nfa's and regular expressions
Journal of Computer and System Sciences, 2005 AbstractWe show inapproximability results concerning minimization of nondeterministic finite automata (nfa's) as well as of regular expressions relative to given nfa's, regular expressions or deterministic finite automata (dfa's).We show that it is impossible to efficiently minimize a given nfa or regular expression with n states, transitions ...
Gregor Gramlich, Georg Schnitger
openaire +3 more sources
Tumor necrosis factor gene expression in regular hemodialysis patients
Saudi Journal of Kidney Diseases and Transplantation, 2015 This study evaluates tumor necrosis factor (TNF)-alfa gene expression in patients with end-stage renal disease (ESRD) on regular hemodialysis as an expression of cardiovascular disease (CVD) risk even on a sub-clinical level and its relation to some of ...
Hemmat E El Haddad +5 more
doaj +1 more source
Particle motion and collisions around rotating regular black hole
, 2014 The neutral particle motion around rotating regular black hole that was derived from the Ay\'{o}n-Beato-Garc\'{i}a black hole solution by the Newman-Janis algorithm in the preceding paper [Phys. Rev. D 89, 104017, (2014)] has been studied.
Abdujabbarov, Ahmadjon +3 more
core +1 more source
On the Expressive Power of Regular Expressions with Backreferences
, 2023 A rewb is a regular expression extended with a feature called backreference. It is broadly known that backreference is a practical extension of regular expressions, and is supported by most modern regular expression engines, such as those in the standard libraries of Java, Python, and more.
Nogami, Taisei, Terauchi, Tachio
openaire +4 more sources
Deafness mutation mining using regular expression based pattern matching
BMC Medical Informatics and Decision Making, 2007 Background While keyword based queries of databases such as Pubmed are frequently of great utility, the ability to use regular expressions in place of a keyword can often improve the results output by such databases. Regular expressions can allow for the
Frenz Christopher M
doaj +1 more source
Automated DNA Motif Discovery [PDF]
, 2010 Ensembl's human non-coding and protein coding genes are used to automatically find DNA pattern motifs. The Backus-Naur form (BNF) grammar for regular expressions (RE) is used by genetic programming to ensure the generated strings are legal.
Graillet, Olivia Sanchez +2 more
core +2 more sources
New bounds for the max-$k$-cut and chromatic number of a graph
, 2015 We consider several semidefinite programming relaxations for the max-$k$-cut problem, with increasing complexity. The optimal solution of the weakest presented semidefinite programming relaxation has a closed form expression that includes the largest ...
Sotirov, Renata, van Dam, Edwin R.
core +2 more sources
A lexical database tool for quantitative phonological research
, 1997 A lexical database tool tailored for phonological research is described. Database fields include transcriptions, glosses and hyperlinks to speech files.
Bird, Steven
core +3 more sources