Science Fair Project Encyclopedia
Convolution (computer science)
In computer science, specifically formal languages, a convolution is defined as follows:
Let ∑ be an alphabet, # a symbol not in ∑.
Let x1x2... x|x|, y1y2... y|y|, z1z2... z|z|, ... be n words over ∑*. Let l denote the maximum length.
The convolution of these words is
where for any index i > |w|, the wi is #. This is a new word in
.
The convolution of x, y, z, ... is sometimes denoted conv( x, y, z, ...), or x ⋆ y ⋆ z ⋆ ...
Example
The convolution of and, fish, be is
10-26-2009 08:16:03
The contents of this article is licensed from www.wikipedia.org under the GNU Free Documentation License. Click here to see the transparent copy and copyright details
The contents of this article is licensed from www.wikipedia.org under the GNU Free Documentation License. Click here to see the transparent copy and copyright details