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:
“On every formal visit a child ought to be of the party, by way of provision for discourse.”
—Jane Austen (1775–1817)
“The angels are so enamored of the language that is spoken in heaven, that they will not distort their lips with the hissing and unmusical dialects of men, but speak their own, whether there be any who understand it or not.”
—Ralph Waldo Emerson (1803–1882)
“Every theory is a self-fulfilling prophecy that orders experience into the framework it provides.”
—Ruth Hubbard (b. 1924)