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:
“I would rather have as my patron a host of anonymous citizens digging into their own pockets for the price of a book or a magazine than a small body of enlightened and responsible men administering public funds. I would rather chance my personal vision of truth striking home here and there in the chaos of publication that exists than attempt to filter it through a few sets of official, honorably public-spirited scruples.”
—John Updike (b. 1932)
“There are strings in the human heart that had better not be vibrated.”
—Charles Dickens (1812–1870)