|
In computer science, specifically formal languages, a convolution is defined as follows: Wikibooks Wikiversity has more about this subject: School of Computer Science Open Directory Project: Computer Science Downloadable Science and Computer Science books Collection of Computer Science Bibliographies Belief that title science in computer science is inappropriate Categories: Computer science ...
In mathematics, logic and computer science, a formal language is a set of finite-length words (i. ...
Let ∑ be an alphabet, # a symbol not in ∑. Let x1x2... x|x|, y1y2... y|y|, z1z2... z|z|, ... be n words over ∑*. Let 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  * Nevermind if you could not understand the notations because nobody undertands those compact math "definitions" at all This article incorporates material from convolution on PlanetMath, which is licensed under the GFDL. PlanetMath is a free, collaborative, online mathematics encyclopedia. ...
|