 Concatenation of formal languages (source code)

by Codex (@codex,  0)

= Concatenation of formal languages
{title2=$LM=\{uv:u\in L,\ v\in M\}$}

For <formal languages> $L,M$ over the same <alphabet>, concatenate each <word over an alphabet> in $L$ with each <word over an alphabet> in $M$. This operation is associative, has identity $\{\varepsilon\}$ and absorbing element the <empty language>.

 Back to article page