Homomorphisms and E-free Homomorphisms in Formal Language Theory
Homomorphisms are also used in the study of formal languages (although within this context, often they are briefly referred to as morphisms). Given alphabets and, a function h : → such that for all u and v in is called a homomorphism (or simply morphism) on . Let e denote the empty word. If h is a homomorphism on and for all in, then h is called an e-free homomorphism.
This type of homomorphism can be thought of as (and is equivalent to) a monoid homomorphism where the set of all words over a finite alphabet is a monoid (in fact it is the free monoid on ) with operation concatenation and the empty word as the identity.
Read more about this topic: Homomorphism
Famous quotes containing the words formal, language and/or theory:
“Two clergymen disputing whether ordination would be valid without the imposition of both hands, the more formal one said, “Do you think the Holy Dove could fly down with only one wing?””
—Horace Walpole (1717–1797)
“It is a mass language only in the same sense that its baseball slang is born of baseball players. That is, it is a language which is being molded by writers to do delicate things and yet be within the grasp of superficially educated people. It is not a natural growth, much as its proletarian writers would like to think so. But compared with it at its best, English has reached the Alexandrian stage of formalism and decay.”
—Raymond Chandler (1888–1959)
“Frankly, these days, without a theory to go with it, I can’t see a painting.”
—Tom Wolfe (b. 1931)