Show Summary Details

Quick Reference

The operation of joining two strings to form a longer string. The concatenation of the strings u = a1,…,am and v = b1,…,bn is the following string of length m + n: a1,…,amb1,…,bn Common notations for referring to it include uv and u`bv, but others are also used.

u = a1,…,am and v = b1,…,bn


The term concatenation is also generalized to an operation on sets of strings (i.e. formal languages). Let K and L be two sets of strings. Then they can be combined into the following set by concatenating strings from K with strings from L in all isible ways:

{uv | uK, vL} This set is usually written KL. The phrase language concatenation is sometimes used to distinguish this from simple concatenation of strings. Both string concatenation and language concatenation gives rise to monoids, the identity elements being λ and {λ} respectively (where λ is the empty string).

{uv | uK, vL}

Subjects: Computing.

Reference entries

Users without a subscription are not able to see the full content. Please, subscribe or login to access all content.