Sentence examples for a given string from inspiring English sources

Be able to write a regular expression, decide whether a given string is matched by a regular expression, etc.

A suffix tree, which provides us with a linear space full-text index of a given string, is a fundamental data structure for string processing and information retrieval.

While writing IPv6-capable applications, situations where it is needed to extract a numeric IPv6 address from a given string (such as a URL) will be encountered.

Shortest common supersequence (SCS) is a classical NP-hard problem, where a string to be constructed that is the supersequence of a given string set.

We design an efficient algorithm that decides whether or not a given string is a pseudoknot of a regular language L. Our algorithm runs in linear time if L is given by a deterministic finite automaton.

We expect that these definitions give the same answers, and the intuitive argument is that both definitions describe the path from state q with a given string as the label.

The tension in a given strand of string or rope is a result of the forces pulling on the rope from either end.

The puts function should take an input world and a string, and output a whole new world: a world where the given string has been printed.

Create a digital signature for the given string, write it to stdout.

Note that t ∈ I A. Further, for the given string t = TGCT, we have x' = C, p = ATG, and q = CT.

Given a string t ∈ I x where x ∈ ∑, we define H i,   t to be the minimum Hamming distance between the prefix of s of length i and a string which is such that - all its substrings are I-compatible with C ∑, - it begins with a string from L y for some y ∈ Σ, and - it ends with the given string t.