Talk:Convolution (computer science)

From Wikipedia, the free encyclopedia

	Philosophy Portal This article is within the scope of the WikiProject Philosophy, which collaborates on articles related to philosophy. To participate, you can edit this article or visit the project page for more details.
???	This article has not yet received a rating on the quality scale.
???	This article has not yet received an importance rating on the importance scale.
Additional information: Related task forces (core areas): Logic

This article incorporates material from PlanetMath, which is licensed under the GFDL.

Nevermind if you could not understand the notations because nobody undertands those compact math definition at all

I think some (technically) oriented people would understand it better if it was explained in terms of [regular expressions]. I think I'm right, although the formula given looks a bit odd or off. (What does "n" have to do with anything?) I'm assuming "#" is taken to be the null string. The convolution of the words and, fish, be in regex form is

(a|f|b)(n|i|e)(d|s|)(|h|)

thus some words formed from this are "andh", "bish", "beh" (be#h => beh), "an", "aid", etc.

BTW, all this is memory from my formal language theory class a few years ago, so take warning. Root⁴(one) 20:28, 4 April 2007 (UTC)