Lcontaining
Lcontaining is a term used in formal language theory to describe strings that contain a substring belonging to a given language L.
Definition: Let L be a language over an alphabet Σ. A word w ∈ Σ* is called L-containing if
Examples: If L = { "ab", "ba" } over Σ = {a, b}, then w = "cabd" is L-containing because it contains
Checking and representations: For finite L, checking whether a word is L-containing reduces to searching for
Variants and related concepts: A related notion is L-free, where a word contains no substring that belongs
Applications: L-containing concepts appear in pattern matching, text processing, pattern avoidance studies, and analyses of subword