Search results

...points in the database that are connected by a path satisfying a certain [[regular expression]]. A similar feature exists in the [[SPARQL]] query language as ...nd there is an edge label "parent" for edges from a parent to a child, the regular path query <math>\text{parent} \text{parent}^*</math> would select pairs of ...

...ministic finite automaton]] (NFA). Thus, it forms a bridge between regular expressions and nondeterministic finite automata: two abstract representations of the s ...by nature, as the number of its states equals the number of symbols of the regular expression, plus one. ...

...>{{cite journal| author=Janusz A. Brzozowski| title=Derivatives of Regular Expressions| journal=J ACM| year=1964| volume=11| issue=4| pages=481–494| doi=10.1145/3 Even though originally studied for regular expressions, the definition applies to arbitrary formal languages. ...

{{Short description|Algorithm to transform a regular expression into a finite automaton}} ...ef> This NFA can be used to [[pattern matching|match strings]] against the regular expression. This algorithm is credited to [[Ken Thompson]]. ...

{{Short description|Regular expression denial-of-service attack}} A '''regular expression denial of service''' ('''ReDoS''')<ref name="ReDoS in OWASP"> ...

===Example: 2D discrete Laplacian on a regular grid with the homogeneous Dirichlet boundary condition=== ...is a sample [[GNU_Octave|OCTAVE]]/[[MATLAB]] code to compute ''L'' on the regular 10&times;15 2D grid: ...

...ular language|rational (or regular) language]] (understood as defined by [[regular expression]]s) to monoids that are not necessarily [[free monoid|free]].{{s ...ar language]]s. Indeed, the regular languages may be defined by a finite [[regular expression]]. ...

...rth. (A special [[ordinal arithmetic]] is defined to give meaning to these expressions, since the {{math|+}} symbol here does not represent the addition of two [[ ...

...an arbitrary [[noncommutative ring]] and over the [[semiring]] of regular expressions.{{sfn|Pliam|Lee|1995}} ...e alternating product of node factors and path weights, we obtain two gain expressions: ...

...ons to generate scanners for Bison parsers. RE/flex includes a fast C++ [[regular expression]] library. ...ons made by others. The RE/flex tool generates lexical analyzers based on regular expression ("regex") libraries, instead of fixed [[Deterministic finite aut ...

...ly for graphs of [[parity (mathematics)|odd]] degree, as in that case both expressions are equal. For graphs of [[parity (mathematics)|even]] degree it would impl ...d the linear arboricity cannot equal <math>\Delta/2</math>. Therefore, for regular graphs, the linear arboricity conjecture implies that the linear arboricity ...

...an identify positions in the input string that match tagged positions in a regular expression ('''tags''' are meta-symbols similar to capturing parentheses, b ...ons, their conversion to deterministic automata and application to regular expressions ...

...nfo| publisher=RegularExpressions.info| year=2018| url=https://www.regular-expressions.info/}}</ref> ...ix to match against. This is a form of [[backtracking]], also done by some regular expression matchers. ...

...[tree-depth]] of an [[undirected graph]] and to the [[star height]] of a [[regular language]]. It has also found use ...ntroduced by {{harvtxt|Eggan|1963}} in the context of [[star height]] of [[regular language]]s. It was rediscovered by {{harv|Eisenstat|Liu|2005}} as a genera ...

Lambda expressions are composed of The set of lambda expressions, <math>\Lambda </math>, can be [[Recursive definition|defined inductively]] ...

...1}} ),}} with no singularities and no [[imaginary number]]s arising in the expressions as the launch vehicle gains speed to escape velocity and beyond. (The same |title=Linear and Regular Celestial Mechanics: Perturbed two-body motion, numerical methods, canonica ...

...ement of a semiring is quasiregular then the semiring is called a '''quasi-regular semiring''', '''closed semiring''',<ref name="PoulyKohlas2012b">{{cite book ...the quasi-inverse of any element ''a'' ≥ 1 being the infinity. This quasi-regular semiring is not additively idempotent however, so it is not a Kleene algebr ...

...lass of algebras was first studied in the classification of Artin-Schelter regular<ref name=":3" /> algebras of [[global dimension]] 3 in the 1980s.<ref name= ...1-8708|last1=Artin|first1=Michael|last2=Schelter|first2=William F.}}</ref> regular.<ref name=":2" /> Therefore, they have [[global dimension]] 3 and [[Gelfand ...

The Teiresias algorithm uses [[regular expressions]] to define the patterns. This allows the patterns reported to consist not ...

...nt Circuit Analysis |journal= IEEE Transactions on Circuits and Systems I: Regular Papers|volume=57 |issue=6 |pages=1105–1121 |date=June 2010 |doi=10.1109/TCS ...ing a sufficient number of numerator and denominator terms using the above expressions. ...