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 and/or theory:
“Good gentlemen, look fresh and merrily.
Let not our looks put on our purposes,
But bear it as our Roman actors do,
With untired spirits and formal constancy.”
—William Shakespeare (15641616)
“There never comes a point where a theory can be said to be true. The most that one can claim for any theory is that it has shared the successes of all its rivals and that it has passed at least one test which they have failed.”
—A.J. (Alfred Jules)