Concatenation of Sets of Strings
In formal language theory and pattern matching (including regular expressions), the concatenation operation on strings is generalized to an operation on sets of strings as follows:
For two sets of strings S1 and S2, the concatenation S1S2 consists of all strings of the form vw where v is a string from S1 and w is a string from S2.
In this definition, the string vw is the ordinary concatenation of strings v and w as defined in the introductory section. In this context, sets of strings are often referred to as formal languages.
There is typically no explicit concatenation operator, simply juxtaposition (as with multiplication).
Read more about this topic: Concatenation
Famous quotes containing the words sets and/or strings:
“There be some sports are painful, and their labor
Delight in them sets off. Some kinds of baseness
Are nobly undergone, and most poor matters
Point to rich ends.”
—William Shakespeare (1564–1616)
“Until, accustomed to disappointments, you can let yourself rule and be ruled by these strings or emanations that connect everything together, you haven’t fully exorcised the demon of doubt that sets you in motion like a rocking horse that cannot stop rocking.”
—John Ashbery (b. 1927)